Cover Image

Peaked quantum advantage using error correction

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Deshpande, Abhinav, Fefferman, Bill, Ghosh, Soumik, Gullans, Michael, Hangleiter, Dominik
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bell sampling from quantum circuits
by: Hangleiter, Dominik, et al.
Published: (2023)

Has quantum advantage been achieved?
by: Hangleiter, Dominik
Published: (2026)

Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits
by: Fefferman, Bill, et al.
Published: (2024)

Random regular graph states are complex at almost any depth
by: Ghosh, Soumik, et al.
Published: (2024)

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
by: Nelson, Jon, et al.
Published: (2024)

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

On the Complexity of Decoded Quantum Interferometry
by: Marwaha, Kunal, et al.
Published: (2025)

Exponential improvements to the average-case hardness of BosonSampling
by: Bouland, Adam, et al.
Published: (2024)

Quantum Merlin-Arthur with an internally separable proof
by: Bassirian, Roozbeh, et al.
Published: (2024)

Sample-efficient benchmarking of shallow all-to-all random quantum circuits
by: Bentsen, Gregory, et al.
Published: (2026)

Fault-tolerant compiling of classically hard IQP circuits on hypercubes
by: Hangleiter, Dominik, et al.
Published: (2024)

Unconditional Pseudorandomness against Shallow Quantum Circuits
by: Ghosh, Soumik, et al.
Published: (2025)

Complexity-theoretic foundations of BosonSampling with a linear number of modes
by: Bouland, Adam, et al.
Published: (2023)

Positive bias makes tensor-network contraction tractable
by: Jiang, Jiaqing, et al.
Published: (2024)

The vast world of quantum advantage
by: Huang, Hsin-Yuan, et al.
Published: (2025)

On the complexity of sampling from shallow Brownian circuits
by: Bentsen, Gregory, et al.
Published: (2024)

Verifiable measurement-based quantum random sampling with trapped ions
by: Ringbauer, Martin, et al.
Published: (2023)

Entanglement-induced provable and robust quantum learning advantages
by: Zhao, Haimeng, et al.
Published: (2024)

Quantum information advantage based on Bell inequalities
by: Jain, Rahul, et al.
Published: (2026)

Quantum advantage from random geometrically-two-local Hamiltonian dynamics
by: Quek, Yihui
Published: (2025)

Scalable and fault-tolerant preparation of encoded k-uniform states
by: Majidy, Shayan, et al.
Published: (2025)

Fast computational deep thermalization
by: Chakraborty, Shantanav, et al.
Published: (2025)

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

An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory
by: Pirnay, Niklas, et al.
Published: (2022)

StoqMA vs. MA: the power of error reduction
by: Aharonov, Dorit, et al.
Published: (2020)

Quantum advantage from measurement-induced entanglement in random shallow circuits
by: Watts, Adam Bene, et al.
Published: (2024)

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

Exponential quantum advantage in processing massive classical data
by: Zhao, Haimeng, et al.
Published: (2026)

No distributed quantum advantage for approximate graph coloring
by: Coiteux-Roy, Xavier, et al.
Published: (2023)

Quasi-quantum states and the quasi-quantum PCP theorem
by: Arad, Itai, et al.
Published: (2024)

On the complexity of unique quantum witnesses and quantum approximate counting
by: Anshu, Anurag, et al.
Published: (2024)

Classical versus quantum queries in quantum PCPs with classical proofs
by: Buhrman, Harry, et al.
Published: (2024)

Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy
by: Anand, Kartik, et al.
Published: (2025)

Symmetric quantum computation
by: Castro-Silva, Davi, et al.
Published: (2025)

The Hardness of Learning Quantum Circuits and its Cryptographic Applications
by: Fefferman, Bill, et al.
Published: (2025)

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
by: Iyer, Vishnu, et al.
Published: (2026)

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

The 7 faces of quantum NP
by: Gharibian, Sevag
Published: (2023)

Improved quantum data analysis
by: Bădescu, Costin, et al.
Published: (2020)

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