Cover Image

A simplified version of the quantum OTOC$^{(2)}$ problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	King, Robbie, Kothari, Robin, Babbush, Ryan, Boixo, Sergio, Kechedzhi, Kostyantyn, O'Brien, Thomas E., Smelyanskiy, Vadim
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

Quartic quantum speedups for planted inference
by: Schmidhuber, Alexander, et al.
Published: (2024)

Shadow Hamiltonian Simulation
by: Somma, Rolando D., et al.
Published: (2024)

Triply efficient shadow tomography
by: King, Robbie, et al.
Published: (2024)

No exponential quantum speedup for $\mathrm{SIS}^\infty$ anymore
by: Kothari, Robin, et al.
Published: (2025)

Uniformity testing when you have the source code
by: Canonne, Clément L., et al.
Published: (2024)

Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
by: Kechedzhi, K., et al.
Published: (2023)

The Grand Challenge of Quantum Applications
by: Babbush, Ryan, et al.
Published: (2025)

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

Quantum computing and persistence in topological data analysis
by: Gyurik, Casper, et al.
Published: (2024)

Rational degree is polynomially related to degree
by: Kothari, Robin, et al.
Published: (2026)

The status of the quantum PCP conjecture (games version)
by: Natarajan, Anand, et al.
Published: (2024)

On the Rational Degree of Boolean Functions and Applications
by: Iyer, Vishnu, et al.
Published: (2023)

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

Influence of Trotterization error on single-particle tunneling
by: Khvalyuk, Anton V., et al.
Published: (2023)

The membership problem for constant-sized quantum correlations is undecidable
by: Fu, Honghao, et al.
Published: (2021)

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem
by: Aldi, Marco, et al.
Published: (2024)

Derandomised tensor product gap amplification for quantum Hamiltonians
by: Bergamaschi, Thiago, et al.
Published: (2025)

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

The dihedral hidden subgroup problem
by: Chen, Imin, et al.
Published: (2021)

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)

Quantum state isomorphism problems for groups
by: Gheorghiu, Alexandru, et al.
Published: (2026)

Hardness of approximation for ground state problems
by: Gharibian, Sevag, et al.
Published: (2024)

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

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

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

Separations in query complexity for total search problems
by: Ben-David, Shalev, et al.
Published: (2024)

Quantum algorithms for path and cycle containment problems
by: Cornelissen, Arjan, et al.
Published: (2026)

Symmetric quantum computation
by: Castro-Silva, Davi, 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)

QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more
by: Chen, Yanlin, et al.
Published: (2023)

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)

Approximating the quantum value of an LCS game is RE-hard
by: Taller, Aviv, et al.
Published: (2025)

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

On the average-case complexity of learning output distributions of quantum circuits
by: Nietner, Alexander, et al.
Published: (2023)

The rotation-invariant Hamiltonian problem is QMA$_{\rm EXP}$-complete
by: Nelson, Jon, et al.
Published: (2025)

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

Optimising quantum circuits is generally hard
by: van de Wetering, John, et al.
Published: (2023)

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