QAOA on qudit-encoded integer graph problems outperforms the Frieze-Jerrum SDP for Max-k-Cut at p≤4 in regimes k=3 d≤10 and k=4 d≤40, while a new degree-of-saturation heuristic beats both on GSet but may be overtaken by QAOA at p≤20.
Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections
7 Pith papers cite this work, alongside 13 external citations. Polarity classification is still indexing.
7
Pith papers citing it
13
external citations · external index
citation-role summary
background 1
baseline 1
citation-polarity summary
fields
quant-ph 7representative citing papers
SPRINT and GRADE cut Toffoli cost 4.5x versus prior Trotter methods for Li4Mn2O X-ray spectrum simulation while using 5.5x fewer qubits than qubitization alternatives.
The biplanar architecture maps Fermi-Hubbard spin sectors to two planes, eliminating swaps and cutting each Trotter step depth to 4t_synth + 90 logical timesteps versus 6t_synth + 354 in single-plane methods, yielding an estimated 2-hour runtime for L=8 with 1.35 million physical qubits under a 1% 1
Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.
A 3D convolutional neural network decoder for surface codes with circuit noise generalizes to distance-97 codes with thresholds up to 0.7% depolarizing noise and improved latency over MWPM above distance 33.
Quantum sieving for SVP in dimension 400 needs ~10^13 physical qubits and ~10^31 years under optimistic assumptions, offering no practical speedup over classical methods.
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
citing papers explorer
-
Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut
QAOA on qudit-encoded integer graph problems outperforms the Frieze-Jerrum SDP for Max-k-Cut at p≤4 in regimes k=3 d≤10 and k=4 d≤40, while a new degree-of-saturation heuristic beats both on GSet but may be overtaken by QAOA at p≤20.
-
Theory and practice of Trotter product formulas for quantum chemistry
SPRINT and GRADE cut Toffoli cost 4.5x versus prior Trotter methods for Li4Mn2O X-ray spectrum simulation while using 5.5x fewer qubits than qubitization alternatives.
-
Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation
The biplanar architecture maps Fermi-Hubbard spin sectors to two planes, eliminating swaps and cutting each Trotter step depth to 4t_synth + 90 logical timesteps versus 6t_synth + 354 in single-plane methods, yielding an estimated 2-hour runtime for L=8 with 1.35 million physical qubits under a 1% 1
-
Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.
-
Fully convolutional 3D neural network decoders for surface codes with syndrome circuit noise
A 3D convolutional neural network decoder for surface codes with circuit noise generalizes to distance-97 codes with thresholds up to 0.7% depolarizing noise and improved latency over MWPM above distance 33.
-
On the practicality of quantum sieving algorithms for the shortest vector problem
Quantum sieving for SVP in dimension 400 needs ~10^13 physical qubits and ~10^31 years under optimistic assumptions, offering no practical speedup over classical methods.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.