Formal Framework for Quantum Advantage
Fuente:
arXiv
Saved in:
| Main Authors: | Buhrman, Harry, Galke, Niklas, Meichanetzidis, Konstantinos |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
by: Buhrman, Harry, et al.
Published: (2024)
by: Buhrman, Harry, et al.
Published: (2024)
A Qubit, a Coin, and an Advice String Walk Into a Relational Problem
by: Aaronson, Scott, et al.
Published: (2023)
by: Aaronson, Scott, et al.
Published: (2023)
Classical versus quantum queries in quantum PCPs with classical proofs
by: Buhrman, Harry, et al.
Published: (2024)
by: Buhrman, Harry, et al.
Published: (2024)
Beating the natural Grover bound for low-energy estimation and state preparation
by: Buhrman, Harry, et al.
Published: (2024)
by: Buhrman, Harry, et al.
Published: (2024)
Quantum Communication Advantage in TFNP
by: Göös, Mika, et al.
Published: (2024)
by: Göös, Mika, et al.
Published: (2024)
Unconditional Quantum Advantage for Sampling with Shallow Circuits
by: Watts, Adam Bene, et al.
Published: (2023)
by: Watts, Adam Bene, et al.
Published: (2023)
A Criterion for Post-Selected Quantum Advantage
by: Karamchedu, Chaitanya, et al.
Published: (2024)
by: Karamchedu, Chaitanya, et al.
Published: (2024)
Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
by: Lykov, Danylo, et al.
Published: (2022)
by: Lykov, Danylo, et al.
Published: (2022)
Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
by: Grier, Daniel, et al.
Published: (2025)
by: Grier, Daniel, et al.
Published: (2025)
Quantum Advantage in Decision Trees: A Weighted Graph and $L_1$ Norm Approach
by: Grillo, Sebastian Alberto, et al.
Published: (2026)
by: Grillo, Sebastian Alberto, et al.
Published: (2026)
Verifiable Quantum Advantage without Structure
by: Yamakawa, Takashi, et al.
Published: (2022)
by: Yamakawa, Takashi, et al.
Published: (2022)
Quantum Advantage from One-Way Functions
by: Morimae, Tomoyuki, et al.
Published: (2023)
by: Morimae, Tomoyuki, et al.
Published: (2023)
The Computational Advantage of MIP* Vanishes in the Presence of Noise
by: Dong, Yangjing, et al.
Published: (2023)
by: Dong, Yangjing, et al.
Published: (2023)
Distributed Quantum Advantage for Local Problems
by: Balliu, Alkida, et al.
Published: (2024)
by: Balliu, Alkida, et al.
Published: (2024)
Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
by: Gao, Xun, et al.
Published: (2021)
by: Gao, Xun, et al.
Published: (2021)
Quantum Advantages in (n,d)->1 Random Access Codes
by: Ambainis, Andris, et al.
Published: (2015)
by: Ambainis, Andris, et al.
Published: (2015)
Distributed Quantum Advantage in Locally Checkable Labeling Problems
by: Balliu, Alkida, et al.
Published: (2025)
by: Balliu, Alkida, et al.
Published: (2025)
Provable and Verifiable Quantum Advantage in Sample Complexity
by: Benedetti, Marcello, et al.
Published: (2025)
by: Benedetti, Marcello, et al.
Published: (2025)
A Graphical #SAT Algorithm for Formulae with Small Clause Density
by: Laakkonen, Tuomas, et al.
Published: (2022)
by: Laakkonen, Tuomas, et al.
Published: (2022)
Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
by: Guseynov, Nikita, et al.
Published: (2026)
by: Guseynov, Nikita, et al.
Published: (2026)
Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
by: Yamakami, Tomoyuki
Published: (2023)
by: Yamakami, Tomoyuki
Published: (2023)
Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
by: Gharibian, Sevag, et al.
Published: (2021)
by: Gharibian, Sevag, et al.
Published: (2021)
New Quantum Algorithms for Computing Quantum Entropies and Distances
by: Wang, Qisheng, et al.
Published: (2022)
by: Wang, Qisheng, et al.
Published: (2022)
Quantum Algorithms for Compositional Text Processing
by: Laakkonen, Tuomas, et al.
Published: (2024)
by: Laakkonen, Tuomas, et al.
Published: (2024)
Basic Quantum Algorithms
by: Portugal, Renato
Published: (2022)
by: Portugal, Renato
Published: (2022)
Quantum Threshold is Powerful
by: Grier, Daniel, et al.
Published: (2024)
by: Grier, Daniel, et al.
Published: (2024)
Uncloneable Quantum Advice
by: Broadbent, Anne, et al.
Published: (2023)
by: Broadbent, Anne, et al.
Published: (2023)
Quantum Search With Generalized Wildcards
by: Cornelissen, Arjan, et al.
Published: (2025)
by: Cornelissen, Arjan, et al.
Published: (2025)
Efficient Quantum Hermite Transform
by: Jain, Siddhartha, et al.
Published: (2025)
by: Jain, Siddhartha, et al.
Published: (2025)
On the Complexity of Decoded Quantum Interferometry
by: Marwaha, Kunal, et al.
Published: (2025)
by: Marwaha, Kunal, et al.
Published: (2025)
Efficient Algorithms for Quantum Hashing
by: Zinnatullin, Ilnar, et al.
Published: (2025)
by: Zinnatullin, Ilnar, et al.
Published: (2025)
Quantum Interactive Oracle Proofs
by: Sun, Baocheng, et al.
Published: (2026)
by: Sun, Baocheng, et al.
Published: (2026)
An Efficient Quantum Factoring Algorithm
by: Regev, Oded
Published: (2023)
by: Regev, Oded
Published: (2023)
The Power of Lorentz Quantum Computer
by: Zhang, Qi, et al.
Published: (2024)
by: Zhang, Qi, et al.
Published: (2024)
On the Need for Large Quantum Depth
by: Chia, Nai-Hui, et al.
Published: (2019)
by: Chia, Nai-Hui, et al.
Published: (2019)
Pseudo-deterministic Quantum Algorithms
by: Aaronson, Hugo, et al.
Published: (2026)
by: Aaronson, Hugo, et al.
Published: (2026)
Bosonic Quantum Computational Complexity
by: Chabaud, Ulysse, et al.
Published: (2024)
by: Chabaud, Ulysse, et al.
Published: (2024)
Random Unitaries in Constant (Quantum) Time
by: Foxman, Ben, et al.
Published: (2025)
by: Foxman, Ben, et al.
Published: (2025)
A Cautionary Note on Quantum Oracles
by: Agarwal, Avantika, et al.
Published: (2025)
by: Agarwal, Avantika, et al.
Published: (2025)
Fourier Spectrum of Noisy Quantum Algorithms
by: Girish, Uma
Published: (2025)
by: Girish, Uma
Published: (2025)
Similar Items
-
Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
by: Buhrman, Harry, et al.
Published: (2024) -
A Qubit, a Coin, and an Advice String Walk Into a Relational Problem
by: Aaronson, Scott, et al.
Published: (2023) -
Classical versus quantum queries in quantum PCPs with classical proofs
by: Buhrman, Harry, et al.
Published: (2024) -
Beating the natural Grover bound for low-energy estimation and state preparation
by: Buhrman, Harry, et al.
Published: (2024) -
Quantum Communication Advantage in TFNP
by: Göös, Mika, et al.
Published: (2024)