:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kalai, Gil, Shoham, Tomer, Voelkmann, Carsten
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity Applications
Online Access:	https://arxiv.org/abs/2512.10722
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Random Circuit Sampling: Fourier Expansion and Statistics
by: Kalai, Gil, et al.
Published: (2024)

NISQ Security and Complexity via Simple Classical Reasoning
by: Cojocaru, Alexandru, et al.
Published: (2025)

The NISQ Complexity of Collision Finding
by: Hamoudi, Yassine, et al.
Published: (2022)

Generalization Error Bound for Quantum Machine Learning in NISQ Era -- A Survey
by: Khanal, Bikram, et al.
Published: (2024)

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

Quantum Statistical Witness Indistinguishability
by: Nassar, Shafik, et al.
Published: (2025)

Integration of Fractional Order Black-Scholes Merton with Neural Network
by: Maitra, Sarit, et al.
Published: (2023)

Learning Quantum Processes with Quantum Statistical Queries
by: Wadhwa, Chirag, et al.
Published: (2023)

Ranking Vectors Clustering: Theory and Applications
by: Fattahi, Ali, et al.
Published: (2025)

Experimental relativistic zero-knowledge proofs with unconditional security
by: Weng, Chen-Xun, et al.
Published: (2025)

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

More-efficient Quantum Multivariate Mean Value Estimator from Generalized Grover Operator
by: Tang, Letian
Published: (2025)

Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
by: Grewal, Sabee, et al.
Published: (2025)

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

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

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
by: Grier, Daniel, et al.
Published: (2025)

Graphical Tests of Causality
by: Baumeler, Ämin, et al.
Published: (2025)

Tight Success Probabilities for Quantum Period Finding and Phase Estimation
by: Magdon-Ismail, Malik, et al.
Published: (2025)

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

On the Complexity of the Succinct State Local Hamiltonian Problem
by: Waite, Gabriel, et al.
Published: (2025)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
by: Hasegawa, Atsuya, et al.
Published: (2025)

Quantum Subgradient Estimation for Conditional Value-at-Risk Optimization
by: Skarlatos, Vasilis, et al.
Published: (2025)

Shadow Tomography Against Adversaries
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Quantum Search With Generalized Wildcards
by: Cornelissen, Arjan, et al.
Published: (2025)

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
by: Sakamoto, Kazuki, et al.
Published: (2025)

Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group
by: Suruga, Daiki
Published: (2025)

Magic and communication complexity
by: Girish, Uma, et al.
Published: (2025)

Bounds on Eventually Universal Quantum Gate Sets
by: Karamchedu, Chaitanya, et al.
Published: (2025)

When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits
by: Upreti, Varun, et al.
Published: (2025)

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

The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians
by: Waite, Gabriel
Published: (2025)

The Complexity of Local Stoquastic Hamiltonians on 2D Lattices
by: Waite, Gabriel, et al.
Published: (2025)

On the complexity of estimating ground state entanglement and free energy
by: Gharibian, Sevag, et al.
Published: (2025)

Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
by: Barch, Brian, et al.
Published: (2025)

Whether a quantum computation employs nonlocal resources is operationally undecidable
by: Fields, Chris, et al.
Published: (2025)

Random Unitaries in Constant (Quantum) Time
by: Foxman, Ben, et al.
Published: (2025)

Efficient Quantum Hermite Transform
by: Jain, Siddhartha, et al.
Published: (2025)

A Brief Introduction to Quantum Query Complexity
by: Hamoudi, Yassine
Published: (2025)

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

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