Image de couverture de livre

The Space-Time Cost of Purifying Quantum Computations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Zhandry, Mark
Format:	Preprint
Publié:	2024
Sujets:	Quantum Physics Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Computational Separation Between Quantum No-cloning and No-telegraphing
par: Nehoran, Barak, et autres
Publié: (2023)

A Note on Quantum-Secure PRPs
par: Zhandry, Mark
Publié: (2016)

Toward Separating QMA from QCMA with a Classical Oracle
par: Zhandry, Mark
Publié: (2024)

Verifiable Quantum Advantage without Structure
par: Yamakawa, Takashi, et autres
Publié: (2022)

Conjugate queries can help
par: Tang, Ewin, et autres
Publié: (2025)

Separating QMA from QCMA with a classical oracle
par: Bostanci, John, et autres
Publié: (2025)

Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
par: Yamakami, Tomoyuki
Publié: (2025)

Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
par: Yamakami, Tomoyuki
Publié: (2023)

A Schematic Definition of Quantum Polynomial Time Computability
par: Yamakami, Tomoyuki
Publié: (2018)

The Power of Lorentz Quantum Computer
par: Zhang, Qi, et autres
Publié: (2024)

Bosonic Quantum Computational Complexity
par: Chabaud, Ulysse, et autres
Publié: (2024)

New Quantum Algorithms for Computing Quantum Entropies and Distances
par: Wang, Qisheng, et autres
Publié: (2022)

Modifications of Quantum Computation and Adaptive Queries to PP
par: Miloschewsky, David, et autres
Publié: (2025)

Quantum Query-Space Lower Bounds Using Branching Programs
par: Bera, Debajyoti, et autres
Publié: (2024)

Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
par: Barch, Brian, et autres
Publié: (2025)

Random Unitaries in Constant (Quantum) Time
par: Foxman, Ben, et autres
Publié: (2025)

New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
par: Miloschewsky, David, et autres
Publié: (2024)

Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection
par: Hiromasa, Ryo, et autres
Publié: (2022)

Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
par: Lykov, Danylo, et autres
Publié: (2022)

Multimarked Spatial Search by Continuous-Time Quantum Walk
par: Lugão, Pedro H. G., et autres
Publié: (2022)

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
par: Kahanamoku-Meyer, Gregory D., et autres
Publié: (2024)

Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
par: Guseynov, Nikita, et autres
Publié: (2026)

Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy
par: Chia, Nai-Hui, et autres
Publié: (2024)

Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
par: Meyer, Sabri, et autres
Publié: (2025)

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
par: Nelson, Jon, et autres
Publié: (2024)

Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
par: Schleich, Philipp, et autres
Publié: (2024)

On the Computational Hardness of Quantum One-Wayness
par: Cavalar, Bruno, et autres
Publié: (2023)

The Space Just Above One Clean Qubit
par: Jacobs, Dale, et autres
Publié: (2024)

Space-bounded quantum interactive proof systems
par: Gall, François Le, et autres
Publié: (2024)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
par: Gharibian, Sevag, et autres
Publié: (2021)

Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice
par: Yamakami, Tomoyuki
Publié: (2019)

Computational complexity of isometric tensor network states
par: Malz, Daniel, et autres
Publié: (2024)

The Computational Advantage of MIP* Vanishes in the Presence of Noise
par: Dong, Yangjing, et autres
Publié: (2023)

Computational aspects of the trace norm contraction coefficient
par: Delsol, Idris, et autres
Publié: (2025)

Quantum Threshold is Powerful
par: Grier, Daniel, et autres
Publié: (2024)

Basic Quantum Algorithms
par: Portugal, Renato
Publié: (2022)

Uncloneable Quantum Advice
par: Broadbent, Anne, et autres
Publié: (2023)

Why Philosophers Should Care About Computational Complexity
par: Aaronson, Scott
Publié: (2011)

Quantum Communication Advantage in TFNP
par: Göös, Mika, et autres
Publié: (2024)

Quantum Search With Generalized Wildcards
par: Cornelissen, Arjan, et autres
Publié: (2025)