Structural Conditions for Distributed Quantum Advantage
quant-ph, cs.DC
Submitted: 2026-10-03
Updated: 2026-10-03
Sources
- Assessing requirements to scale to practical quantum advantage
- Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
- Crossing the 12,000-atom barrier with heterogeneous quantum-classical supercomputing: quantum chemistry of protein-ligand complexes
- Has quantum advantage been achieved?
- Scalable Quantum Machine Learning: Trainability, Expressivity and Efficiency
- Entanglement geometry separates circuit cutting, classical hardness, and trainability
- Efficient Circuit Transpilation of Commuting Gates on 2D Grids
- A Quantum Approximate Optimization Algorithm
- Quantum Circuits For Two-Dimensional Isometric Tensor Networks
- Circuit depth versus energy in topologically ordered systems
- Efficient calculation of gradients in classical simulations of variational quantum algorithms
- Entanglement in the stabilizer formalism
- Quantum computing with Qiskit
- Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians