Multivariate DQI uses N-variable polynomials for weighted Max-LINSAT, derives closed-form asymptotics for expectation and concentration, provides a single-decoder preparation circuit, and shows outperformance over weighted Prange for some OPI cases while extending to Hamiltonian DQI.
hub Canonical reference
The vast world of quantum advantage
Canonical reference. 80% of citing Pith papers cite this work as background.
18
Pith papers citing it
Background
80% of classified citations
abstract
The quest to identify quantum advantages lies at the heart of quantum technology. While quantum devices promise extraordinary capabilities, from exponential computational speedups to unprecedented measurement precision, distinguishing genuine advantages from mere illusions remains a formidable challenge. In this endeavor, quantum theorists are like prophets attempting to foretell the future, yet the boundary between visionary insight and unfounded fantasy is perilously thin. In this perspective, we examine our mathematical tools for navigating the vast world of quantum advantages across computation, learning, sensing, and communication. We explore five keystone properties: predictability, typicality, robustness, verifiability, and usefulness that define an ideal quantum advantage, and envision what new quantum advantages could arise in a future with ubiquitous quantum technology. We prove that some quantum advantages are inherently unpredictable using classical resources alone, suggesting a landscape far richer than what we can currently foresee. While mathematical rigor remains our indispensable guide, the ultimate power of quantum technologies may emerge from advantages we cannot yet conceive.
hub tools
citation-role summary
background 9
dataset 1
citation-polarity summary
representative citing papers
Typical trace-distance relaxation concentrates around a mean in open quantum systems, producing typical mixing times separated from worst-case by rare-state bottlenecks that scale logarithmically, linearly, or exponentially depending on the slow modes.
Local tensor-train surrogates approximate quantum machine learning models via Taylor polynomials and tensor networks, delivering polynomial parameter scaling and explicit generalization bounds controlled by patch radius.
A polylog-sized quantum computer achieves exponential advantage over classical machines in classification and dimension reduction of massive classical data using quantum oracle sketching combined with classical shadows.
AutoVerifier decomposes technical claims into triples and uses layered LLM verification to assess validity, demonstrated on a quantum computing paper by finding overclaims and conflicts.
A provable exponential quantum-classical learning separation is established for predicting expectation values of time-evolved quantum states under unknown low-intersection Hamiltonians, assuming BQP ⊄ P/poly.
QC-AFQMC per-step scaling reduced from O(N^5.5) to O(N^4.5) via Aitken's block transformation for singular Pfaffians and algorithmic differentiation for force bias, with demonstrations on H8 from real quantum data and Li2O4.
Extends NP-hardness of exceeding r/q + O(1/sqrt(D)) for bounded-degree max-Ek-LINSAT(q,r) over F_q and shows quantum decoding is required for DQI to achieve the hardness-optimal 1/sqrt(D) scaling.
A modular atomic processor with 500,000 qubits factors 2048-bit RSA numbers in roughly the same time as a single large module when inter-module Bell-pair communication runs at 10^5 per second.
HQRN creates an exact functional match to classical residual networks on basis inputs while using quantum correlations for better performance on mixed states in digit recognition and entanglement classification.
A witness-based framework quantifies continuous-variable resources and activates them into discrete-variable entanglement or EPR steering via measure-and-prepare channels that produce Werner states.
QIML uses a quantum-trained Q-Prior to enhance classical autoregressive predictions of spatiotemporal chaos, improving accuracy by up to 17.25% and full-spectrum fidelity by up to 29.36% while enabling stable forecasts for 3D turbulent channel flow.
A tunable mixing parameter p in random quantum circuits controls the transition from classically simulable to expressive quantum reservoir dynamics via entanglement and nonstabilizer content.
End-to-end runtime definitions and strong classical baselines show that three recent quantum advantage claims in annealing, Simon's problem, and hybrid algorithms do not hold on NISQ hardware.
Engineered non-Gaussian coherence serves as a thermodynamic resource that optimizes quantum battery performance beyond Gaussian states for Gaussian charger profiles under unitary dynamics.
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.
A review summarizing superconducting qubit types, DiVincenzo criteria implementations, coherence limits from defects, and large-scale integration strategies for quantum computing.
A review surveying quantum computing hardware platforms, control layers, error correction, and software stacks as of 2023–2025.
citing papers explorer
-
Multivariate Decoded Quantum Interferometry for Weighted Optimization
Multivariate DQI uses N-variable polynomials for weighted Max-LINSAT, derives closed-form asymptotics for expectation and concentration, provides a single-decoder preparation circuit, and shows outperformance over weighted Prange for some OPI cases while extending to Hamiltonian DQI.
-
Typical Mixing and Rare-State Bottlenecks in Open Quantum Systems
Typical trace-distance relaxation concentrates around a mean in open quantum systems, producing typical mixing times separated from worst-case by rare-state bottlenecks that scale logarithmically, linearly, or exponentially depending on the slow modes.
-
Local tensor-train surrogates for quantum learning models
Local tensor-train surrogates approximate quantum machine learning models via Taylor polynomials and tensor networks, delivering polynomial parameter scaling and explicit generalization bounds controlled by patch radius.
-
Exponential quantum advantage in processing massive classical data
A polylog-sized quantum computer achieves exponential advantage over classical machines in classification and dimension reduction of massive classical data using quantum oracle sketching combined with classical shadows.
-
AutoVerifier: An Agentic Automated Verification Framework Using Large Language Models
AutoVerifier decomposes technical claims into triples and uses layered LLM verification to assess validity, demonstrated on a quantum computing paper by finding overclaims and conflicts.
-
Provable learning separation for predicting time-evolution of quantum many-body systems
A provable exponential quantum-classical learning separation is established for predicting expectation values of time-evolved quantum states under unknown low-intersection Hamiltonians, assuming BQP ⊄ P/poly.
-
Quantum-Classical Auxiliary-Field Quantum Monte Carlo at the Edge of Practicability
QC-AFQMC per-step scaling reduced from O(N^5.5) to O(N^4.5) via Aitken's block transformation for singular Pfaffians and algorithmic differentiation for force bias, with demonstrations on H8 from real quantum data and Li2O4.
-
Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry
Extends NP-hardness of exceeding r/q + O(1/sqrt(D)) for bounded-degree max-Ek-LINSAT(q,r) over F_q and shows quantum decoding is required for DQI to achieve the hardness-optimal 1/sqrt(D) scaling.
-
Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor
A modular atomic processor with 500,000 qubits factors 2048-bit RSA numbers in roughly the same time as a single large module when inter-module Bell-pair communication runs at 10^5 per second.
-
Bridge the Gap between Classical and Quantum Neural Networks with Residual Connections
HQRN creates an exact functional match to classical residual networks on basis inputs while using quantum correlations for better performance on mixed states in digit recognition and entanglement classification.
-
Activating entanglement and EPR steering from continuous-variable resources using witness-based measures
A witness-based framework quantifies continuous-variable resources and activates them into discrete-variable entanglement or EPR steering via measure-and-prepare channels that produce Werner states.
-
Quantum-Informed Machine Learning for Predicting Spatiotemporal Chaos with Practical Quantum Advantage
QIML uses a quantum-trained Q-Prior to enhance classical autoregressive predictions of spatiotemporal chaos, improving accuracy by up to 17.25% and full-spectrum fidelity by up to 29.36% while enabling stable forecasts for 3D turbulent channel flow.
-
Optimal quantum reservoir learning in proximity to universality
A tunable mixing parameter p in random quantum circuits controls the transition from classically simulable to expressive quantum reservoir dynamics via entanglement and nonstabilizer content.
-
Recent quantum runtime (dis)advantages
End-to-end runtime definitions and strong classical baselines show that three recent quantum advantage claims in annealing, Simon's problem, and hybrid algorithms do not hold on NISQ hardware.
-
Engineered non-Gaussian Coherence as a Thermodynamic Resource for Quantum Batteries
Engineered non-Gaussian coherence serves as a thermodynamic resource that optimizes quantum battery performance beyond Gaussian states for Gaussian charger profiles under unitary dynamics.
-
Mind the gaps: The fraught road to quantum advantage
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.
-
Review of Superconducting Qubit Devices and Their Large-Scale Integration
A review summarizing superconducting qubit types, DiVincenzo criteria implementations, coherence limits from defects, and large-scale integration strategies for quantum computing.
-
Quantum Computing : A New Frontier for Science and Society
A review surveying quantum computing hardware platforms, control layers, error correction, and software stacks as of 2023–2025.