default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNorbert Schuch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[c2]Harry Buhrman, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert Schuch, Suguru Tamaki:
A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT. SOSA 2026: 247-253- 2025
- [c1]Jiaqing Jiang
, Jielun Chen, Norbert Schuch, Dominik Hangleiter:
Positive Bias Makes Tensor-Network Contraction Tractable. STOC 2025: 471-482 - [i6]Harry Buhrman, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert Schuch, Suguru Tamaki:
A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT. CoRR abs/2510.18164 (2025) - 2024
- [i5]Harry Buhrman, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert Schuch, Suguru Tamaki:
Beating Grover search for low-energy estimation and state preparation. CoRR abs/2407.03073 (2024) - [i4]Jiaqing Jiang, Jielun Chen, Norbert Schuch, Dominik Hangleiter:
Positive bias makes tensor-network contraction tractable. CoRR abs/2410.05414 (2024) - 2022
- [j4]Caroline de Groot, Alex Turzillo, Norbert Schuch:
Symmetry Protected Topological Order in Open Quantum Systems. Quantum 6: 856 (2022) - 2021
- [j3]Clement Delcamp, Norbert Schuch:
On tensor network representations of the (3+1)d toric code. Quantum 5: 604 (2021) - [i3]Bill Fefferman, Sevag Gharibian, Norbert Schuch, Barbara M. Terhal:
Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261). Dagstuhl Reports 11(5): 76-88 (2021)
2010 – 2019
- 2015
- [i2]Tomoyuki Morimae, Daniel Nagaj, Norbert Schuch:
Quantum proofs can be verified using only single qubit measurements. CoRR abs/1510.06789 (2015) - 2011
- [j2]Norbert Schuch:
Complexity of commuting Hamiltonians on a square lattice of qubits. Quantum Inf. Comput. 11(11-12): 901-912 (2011) - 2010
- [j1]Fernando Pastawski, Alastir Kay, Norbert Schuch, J. Ignacio Cirac:
Limitations of passive protection of quantum information. Quantum Inf. Comput. 10(7&8): 580-618 (2010) - [i1]Brielin Brown, Steven T. Flammia, Norbert Schuch:
Computational Difficulty of Computing the Density of States. CoRR abs/1010.3060 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-20 22:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
