Cover Image

Efficiently verifiable quantum advantage on near-term analog quantum simulators

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Zhenning, Devulapalli, Dhruv, Hangleiter, Dominik, Liu, Yi-Kai, Kollár, Alicia J., Gorshkov, Alexey V., Childs, Andrew M.
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Quantum Routing with Teleportation
by: Devulapalli, Dhruv, et al.
Published: (2022)

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

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

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

Interactive proofs for verifying (quantum) learning and testing
by: Caro, Matthias C., et al.
Published: (2024)

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

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

A vapor-cavity-QED system for quantum computation and communication
by: Austin, Sharoon, et al.
Published: (2025)

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

Quantum Routing and Entanglement Dynamics Through Bottlenecks
by: Devulapalli, Dhruv, et al.
Published: (2025)

Low-depth quantum symmetrization
by: Liu, Zhenning, et al.
Published: (2024)

Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes
by: Barthe, Alice, et al.
Published: (2024)

Toward a 2D Local Implementation of Quantum LDPC Codes
by: Berthusen, Noah, et al.
Published: (2024)

How hard is it to verify a classical shadow?
by: Karaiskos, Georgios, et al.
Published: (2025)

Hybrid digital-analog protocols for simulating quantum multi-body interactions
by: Katz, Or, 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)

Short and useful quantum proofs for sublogarithmic-space verifiers
by: Say, A. C. Cem
Published: (2025)

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

Classical simulability of quantum circuits followed by sparse classical post-processing
by: Takahashi, Yasuhiro, et al.
Published: (2026)

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

Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
by: Martinez, Victor, et al.
Published: (2025)

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

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

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

Optimal Routing Protocols for Reconfigurable Atom Arrays
by: Constantinides, Nathan, et al.
Published: (2024)

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

Quantum Merlin-Arthur proof systems for synthesizing quantum states
by: Delavenne, Hugo, 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)

Error-correcting codes for fermionic quantum simulation
by: Chen, Yu-An, et al.
Published: (2022)

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)

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

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

On verifiable quantum advantage with peaked circuit sampling
by: Aaronson, Scott, et al.
Published: (2024)

Measuring gravitational lensing time delays with quantum information processing
by: Liu, Zhenning, et al.
Published: (2025)

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