default search action
Barbara M. Terhal
Person information
- affiliation: Delft University of Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j22]Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen, Barbara M. Terhal:
Optimizing sparse fermionic Hamiltonians. Quantum 7: 1081 (2023) - [i8]Yaroslav Herasymenko, Anurag Anshu, Barbara M. Terhal, Jonas Helsen:
Fermionic Hamiltonians without trivial low-energy states. CoRR abs/2307.13730 (2023) - 2022
- [j21]Alicja Dutkiewicz, Barbara M. Terhal, Thomas E. O'Brien:
Heisenberg-limited quantum phase estimation of multiple eigenvalues with few control qubits. Quantum 6: 830 (2022) - [i7]Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen, Barbara M. Terhal:
Optimizing sparse fermionic Hamiltonians. CoRR abs/2211.16518 (2022) - 2021
- [i6]Bill Fefferman, Sevag Gharibian, Norbert Schuch, Barbara M. Terhal:
Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261). Dagstuhl Reports 11(5): 76-88 (2021) - 2020
- [j20]Joel Klassen, Milad Marvian, Stephen Piddock, Marios Ioannou, Itay Hen, Barbara M. Terhal:
Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians. SIAM J. Comput. 49(6): 1332-1362 (2020) - [i5]Marios Ioannou, Stephen Piddock, Milad Marvian, Joel Klassen, Barbara M. Terhal:
Sign-curing local Hamiltonians: termwise versus global stoquasticity and the use of Clifford transformations. CoRR abs/2007.11964 (2020)
2010 – 2019
- 2019
- [j19]Kasper Duivenvoorden, Nikolas P. Breuckmann, Barbara M. Terhal:
Renormalization Group Decoder for a Four-Dimensional Toric Code. IEEE Trans. Inf. Theory 65(4): 2545-2562 (2019) - 2017
- [j18]Nikolas P. Breuckmann, Kasper Duivenvoorden, Dominik Michels, Barbara M. Terhal:
Local decoders for the 2D and 4D toric code. Quantum Inf. Comput. 17(3&4): 181-208 (2017) - 2016
- [j17]Ben Criger, Barbara M. Terhal:
Noise thresholds for the [4, 2, 2]-concatenated toric code. Quantum Inf. Comput. 16(15&16): 1261-1281 (2016) - [j16]Nikolas P. Breuckmann, Barbara M. Terhal:
Constructions and Noise Threshold of Hyperbolic Surface Codes. IEEE Trans. Inf. Theory 62(6): 3731-3744 (2016) - [r2]Barbara M. Terhal:
Quantum Dense Coding. Encyclopedia of Algorithms 2016: 1695-1698 - 2012
- [c1]Barbara M. Terhal:
The Fragility of Quantum Information? TPNC 2012: 47-56 - 2010
- [p1]Sergey Bravyi, David Poulin, Barbara M. Terhal:
Tradeoffs for reliable quantum information storage in 2D systems. Quantum Cryptography and Computing 2010: 125-137
2000 – 2009
- 2009
- [j15]Andrew W. Cross, David P. DiVincenzo, Barbara M. Terhal:
A comparative code study for quantum fault tolerance. Quantum Inf. Comput. 9(7&8): 541-572 (2009) - [j14]Nikhil Bansal, Sergey Bravyi, Barbara M. Terhal:
Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs. Quantum Inf. Comput. 9(7&8): 701-720 (2009) - [j13]Christian Schaffner, Barbara M. Terhal, Stephanie Wehner:
Robust cryptography in the noisy-quantum-storage model. Quantum Inf. Comput. 9(11&12): 963-996 (2009) - [j12]Sergey Bravyi, Barbara M. Terhal:
Complexity of Stoquastic Frustration-Free Hamiltonians. SIAM J. Comput. 39(4): 1462-1485 (2009) - 2008
- [j11]Sergey Bravyi, David P. DiVincenzo, Roberto Oliveira, Barbara M. Terhal:
The complexity of stoquastic local Hamiltonian problems. Quantum Inf. Comput. 8(5): 361-385 (2008) - [j10]Roberto Oliveira, Barbara M. Terhal:
The complexity of quantum spin systems on a two-dimensional square lattice. Quantum Inf. Comput. 8(10): 900-924 (2008) - [j9]Robert T. König, Barbara M. Terhal:
The Bounded-Storage Model in the Presence of a Quantum Adversary. IEEE Trans. Inf. Theory 54(2): 749-762 (2008) - [r1]Barbara M. Terhal:
Quantum Dense Coding. Encyclopedia of Algorithms 2008 - 2007
- [j8]Panos Aliferis, Barbara M. Terhal:
Fault-tolerant quantum computation for local leakage faults. Quantum Inf. Comput. 7(1): 139-156 (2007) - [j7]Krysta M. Svore, David P. DiVincenzo, Barbara M. Terhal:
Noise threshold for a fault-tolerant two-dimensional lattice architecture. Quantum Inf. Comput. 7(4): 297-318 (2007) - [i4]Stephanie Wehner, Christian Schaffner, Barbara M. Terhal:
Cryptography from Noisy Photonic Storage. CoRR abs/0711.2895 (2007) - 2006
- [i3]Sergey Bravyi, Arvid J. Bessen, Barbara M. Terhal:
Merlin-Arthur Games and Stoquastic Complexity. CoRR abs/quant-ph/0611021 (2006) - 2004
- [j6]Barbara M. Terhal:
Is entanglement monogamous? IBM J. Res. Dev. 48(1): 71-78 (2004) - [j5]Barbara M. Terhal, David P. DiVincenzo:
Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games. Quantum Inf. Comput. 4(2): 134-145 (2004) - 2003
- [j4]Pawel Horodecki, John A. Smolin, Barbara M. Terhal, Ashish V. Thapliyal:
Rank two bipartite bound entangled states do not exist. Theor. Comput. Sci. 292(3): 589-596 (2003) - 2002
- [j3]Barbara M. Terhal:
Detecting quantum entanglement. Theor. Comput. Sci. 287(1): 313-335 (2002) - [j2]David P. DiVincenzo, Debbie W. Leung, Barbara M. Terhal:
Quantum data hiding. IEEE Trans. Inf. Theory 48(3): 580-598 (2002) - [i2]Barbara M. Terhal, David P. DiVincenzo:
Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games. CoRR quant-ph/0205133 (2002) - 2001
- [j1]Michal Horodecki, Pawel Horodecki, Ryszard Horodecki, Debbie W. Leung, Barbara M. Terhal:
Classical capacity of a noiseless quantum channel assisted by noisy entanglement. Quantum Inf. Comput. 1(3): 70-78 (2001) - [i1]Barbara M. Terhal, David P. DiVincenzo:
Classical simulation of noninteracting-fermion quantum circuits. CoRR quant-ph/0108010 (2001)
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 2024-05-02 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint