Barbara M. Terhal

Orcid: 0000-0003-0218-6614

Affiliations:
  • Delft University of Technology, The Netherlands


According to our database1, Barbara M. Terhal authored at least 32 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Optimizing sparse fermionic Hamiltonians.
Quantum, August, 2023

Fermionic Hamiltonians without trivial low-energy states.
CoRR, 2023

2022
Heisenberg-limited quantum phase estimation of multiple eigenvalues with few control qubits.
Quantum, September, 2022

2021
Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261).
Dagstuhl Reports, 2021

2020
Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians.
SIAM J. Comput., 2020

Sign-curing local Hamiltonians: termwise versus global stoquasticity and the use of Clifford transformations.
CoRR, 2020

2019
Renormalization Group Decoder for a Four-Dimensional Toric Code.
IEEE Trans. Inf. Theory, 2019

2017
Local decoders for the 2D and 4D toric code.
Quantum Inf. Comput., 2017

2016
Quantum Dense Coding.
Encyclopedia of Algorithms, 2016

Constructions and Noise Threshold of Hyperbolic Surface Codes.
IEEE Trans. Inf. Theory, 2016

Noise thresholds for the [4, 2, 2]-concatenated toric code.
Quantum Inf. Comput., 2016

2012
The Fragility of Quantum Information?
Proceedings of the Theory and Practice of Natural Computing, 2012

2010
Tradeoffs for reliable quantum information storage in 2D systems.
Proceedings of the Quantum Cryptography and Computing, 2010

2009
Complexity of Stoquastic Frustration-Free Hamiltonians.
SIAM J. Comput., 2009

Robust cryptography in the noisy-quantum-storage model.
Quantum Inf. Comput., 2009

A comparative code study for quantum fault tolerance.
Quantum Inf. Comput., 2009

Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs.
Quantum Inf. Comput., 2009

2008
Quantum Dense Coding.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The Bounded-Storage Model in the Presence of a Quantum Adversary.
IEEE Trans. Inf. Theory, 2008

The complexity of quantum spin systems on a two-dimensional square lattice.
Quantum Inf. Comput., 2008

The complexity of stoquastic local Hamiltonian problems.
Quantum Inf. Comput., 2008

2007
Noise threshold for a fault-tolerant two-dimensional lattice architecture.
Quantum Inf. Comput., 2007

Fault-tolerant quantum computation for local leakage faults.
Quantum Inf. Comput., 2007

Cryptography from Noisy Photonic Storage
CoRR, 2007

2006
Merlin-Arthur Games and Stoquastic Complexity
CoRR, 2006

2004
Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games.
Quantum Inf. Comput., 2004

Is entanglement monogamous?
IBM J. Res. Dev., 2004

2003
Rank two bipartite bound entangled states do not exist.
Theor. Comput. Sci., 2003

2002
Quantum data hiding.
IEEE Trans. Inf. Theory, 2002

Detecting quantum entanglement.
Theor. Comput. Sci., 2002

2001
Classical capacity of a noiseless quantum channel assisted by noisy entanglement.
Quantum Inf. Comput., 2001

Classical simulation of noninteracting-fermion quantum circuits
CoRR, 2001


  Loading...