:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Aharonov, Dorit, Grilo, Alex B., Liu, Yupan
Formato:	Preprint
Publicado:	2020
Materias:	Quantum Physics Computational Complexity
Acceso en línea:	https://arxiv.org/abs/2010.02835
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Syndrome aware mitigation of logical errors
por: Aharonov, Dorit, et al.
Publicado: (2025)

Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
por: Liu, Yupan, et al.
Publicado: (2026)

On estimating the trace of quantum state powers
por: Liu, Yupan, et al.
Publicado: (2024)

The Complexity of Stoquastic Sparse Hamiltonians
por: Grilo, Alex B., et al.
Publicado: (2026)

Quantum state testing beyond the polarizing regime and quantum triangular discrimination
por: Liu, Yupan
Publicado: (2023)

Computational hardness of estimating quantum entropies via binary entropy bounds
por: Liu, Yupan
Publicado: (2026)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
por: Grilo, Alex B., et al.
Publicado: (2024)

Space-bounded quantum state testing via space-efficient quantum singular value transformation
por: Gall, François Le, et al.
Publicado: (2023)

On estimating the quantum $\ell_α$ distance
por: Liu, Yupan, et al.
Publicado: (2025)

Quantum Merlin-Arthur proof systems for synthesizing quantum states
por: Delavenne, Hugo, et al.
Publicado: (2023)

Space-bounded quantum interactive proof systems
por: Gall, François Le, et al.
Publicado: (2024)

The Power of Shallow-depth Toffoli and Qudit Quantum Circuits
por: Grilo, Alex Bredariol, et al.
Publicado: (2024)

A slightly improved upper bound for quantum statistical zero-knowledge
por: Gall, François Le, et al.
Publicado: (2025)

The Role of piracy in quantum proofs
por: Broadbent, Anne, et al.
Publicado: (2024)

Computational complexity of the homology problem with orientable filtration: MA-completeness
por: Hayakawa, Ryu, et al.
Publicado: (2025)

Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds
por: Agarwal, Avantika, et al.
Publicado: (2024)

QMA vs. QCMA and Pseudorandomness
por: Liu, Jiahui, et al.
Publicado: (2024)

On the Importance of Error Mitigation for Quantum Computation
por: Aharonov, Dorit, et al.
Publicado: (2025)

Peaked quantum advantage using error correction
por: Deshpande, Abhinav, et al.
Publicado: (2025)

Finding quantum partial assignments by search-to-decision reductions
por: Weggemans, Jordi
Publicado: (2024)

The power of quantum circuits in sampling
por: Blanc, Guy, et al.
Publicado: (2025)

BQP, meet NP: Search-to-decision reductions and approximate counting
por: Gharibian, Sevag, et al.
Publicado: (2024)

Non-signalling parallel repetition using de Finetti reductions
por: Arnon, Rotem, et al.
Publicado: (2014)

Bounding the computational power of bosonic systems
por: Upreti, Varun, et al.
Publicado: (2025)

Quantum Complexity vs Classical Complexity: A Survey
por: Vaezi, Arash, et al.
Publicado: (2023)

En Route to a Standard QMA1 vs. QCMA Oracle Separation
por: Miloschewsky, David, et al.
Publicado: (2026)

Hardness results for decoding the surface code with Pauli noise
por: Fischer, Alex, et al.
Publicado: (2023)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
por: Li, Xingjian, et al.
Publicado: (2023)

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
por: Cardoso, Ricardo Rivera, et al.
Publicado: (2025)

Fast simulation of planar Clifford circuits
por: Gosset, David, et al.
Publicado: (2020)

Magic and communication complexity
por: Girish, Uma, et al.
Publicado: (2025)

Gap-preserving reductions and RE-completeness of independent set games
por: Mančinska, Laura, et al.
Publicado: (2025)

Proper vs Improper Quantum PAC learning
por: Nayak, Ashwin, et al.
Publicado: (2024)

Satisfiability of commutative vs. non-commutative CSPs
por: Bulatov, Andrei A., et al.
Publicado: (2024)

Quantum state testing with restricted measurements
por: Liu, Yuhan, et al.
Publicado: (2024)

Efficient approximate unitary designs from random Pauli rotations
por: Haah, Jeongwan, et al.
Publicado: (2024)

Efficiently verifiable quantum advantage on near-term analog quantum simulators
por: Liu, Zhenning, et al.
Publicado: (2024)

Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
por: Acharya, Jayadev, et al.
Publicado: (2025)

Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
por: Rajakumar, Joel, et al.
Publicado: (2024)

New Quantum Algorithms for Computing Quantum Entropies and Distances
por: Wang, Qisheng, et al.
Publicado: (2022)