Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while using fewer total qubits.
hub Canonical reference
Fowler, Matteo Mariantoni, John M
Canonical reference. 100% of citing Pith papers cite this work as background.
38
Pith papers citing it
2,565
external citations · Crossref
Background
100% of classified citations
hub tools
citation-role summary
background 6
citation-polarity summary
roles
background 6polarities
background 6representative citing papers
A fermionic permutation protocol on 2D nearest-neighbor grids achieves the optimal O(sqrt(N)) depth with O(N sqrt(N)) gates, no ancillas, and extends to Jordan-Wigner, Bravyi-Kitaev, and Parity encodings via Hilbert-curve layout.
A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.
Embedding experimental quantum states into high-distance codes enables exponential speedups in fault-tolerant shadow tomography and cubic observable estimation over unencoded adaptive strategies.
KOVAL-Q uses SAT solving to optimize and verify surface-code logical operations with general encodings, finding d-cycle CNOTs and 2d-cycle rotations that reduce FTQC application runtime by about 10 percent.
Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
On the snakes-on-a-plane spin qubit architecture, shortest-path routing excels in sparse low-defect settings but fails beyond about 10 qubits, while rotation-based routing keeps working at full grid occupancy at the cost of more timesteps.
Adjusting quantum gate timing via scheduling suppresses idling errors and improves accuracy in simulations and hardware experiments without added gates, supported by an analytical density-matrix derivation.
A design framework that converts an eight-to-three CCZ distillation protocol into a joint-measurement surface-code layout using smaller patches, claimed to cut spatial cost versus Gidney-Fowler while preserving leading-order error suppression and single-fault detection.
A communication-aware multi-GPU distribution approach for tensor network contraction reports 7-173x extra speedup over slicing on 8 H100 GPUs and 42x to 67,869x on 1024 GPUs.
Sparse Mamba Decoder processes only active defects in surface code syndromes using a 13-feature representation and Mamba backbone for O(k) complexity, reporting speedups and accuracy gains over dense decoders.
A linear-time randomized static analysis that propagates constant-width bitstrings enables phase folding and T-count optimization matching SOTA tools on large circuits.
Stochastic magic-state production in fault-tolerant quantum computing inflates execution time but reduces peak resource demand, allowing stochastic-aware factory allocation to cut space-time volume by up to 27% and factories by up to 30% versus deterministic optima.
Symmetry counting of error configurations yields closed-form approximations for logical error rates in surface codes.
MCMit proposes a constant-latency multi-control branch instruction, transformer and CNN discriminators, plus static MCM elimination and stochastic branching, evaluated on Qubic with QPU traces to cut latency by 70% and logical error rates by up to 9.4x.
A logarithmic HUBO encoding with a lexicographic penalty solves minimum graph coloring and related partition-count problems using exponentially fewer qubits per vertex than one-hot encoding.
Orkan simulates quantum operations on Hermitian operators using a cache-friendly tiled lower-triangle layout, halving memory and achieving 2-4x speedups over Qiskit Aer, QuEST, and Qulacs.
Randomized sparse-QSVT reduces gate counts by up to 10x for inhomogeneous many-term Hamiltonians at moderate error (around 10^{-3}), but deterministic QSVT becomes cheaper for higher precision.
Reordering database addresses before ESOP minimization produces smaller QROM circuits for Grover oracles, with simulated annealing yielding roughly 30% size reduction over fixed ordering for small N.
A space-efficient quantum ECDLP algorithm uses 5n + 4⌊log₂n⌋ + O(1) logical qubits and O(n³) Toffoli gates, lowering the 256-bit estimate from 2124 to 1333 qubits.
Multiple-braiding sequences with multiplicities up to nine in SU(2)_k anyon models enable approximation of a universal gate set {H, T, CNOT} for k>2, k≠4, with numerical evidence from genetic algorithms.
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
citing papers explorer
-
Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid
Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while using fewer total qubits.
-
Asymptotically Optimal Depth Fermionic Permutation on 2D Grid Quantum Architecture without Ancillas
A fermionic permutation protocol on 2D nearest-neighbor grids achieves the optimal O(sqrt(N)) depth with O(N sqrt(N)) gates, no ancillas, and extends to Jordan-Wigner, Bravyi-Kitaev, and Parity encodings via Hilbert-curve layout.
-
A Compilation Framework for Quantum Simulation of Non-unitary Dynamics
A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.
-
Exponential speedups in fault-tolerant processing of quantum experiments
Embedding experimental quantum states into high-distance codes enables exponential speedups in fault-tolerant shadow tomography and cubic observable estimation over unencoded adaptive strategies.
-
Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings
KOVAL-Q uses SAT solving to optimize and verify surface-code logical operations with general encodings, finding d-cycle CNOTs and 2d-cycle rotations that reduce FTQC application runtime by about 10 percent.
-
Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.
-
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
-
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
-
Routing Techniques for Error-Corrected Silicon Spin Qubit Quantum Architectures
On the snakes-on-a-plane spin qubit architecture, shortest-path routing excels in sparse low-defect settings but fails beyond about 10 qubits, while rotation-based routing keeps working at full grid occupancy at the cost of more timesteps.
-
Idling error suppression through gate scheduling
Adjusting quantum gate timing via scheduling suppresses idling errors and improves accuracy in simulations and hardware experiments without added gates, supported by an analytical density-matrix derivation.
-
Low Spatial Cost CCZ Magic State Factory
A design framework that converts an eight-to-three CCZ distillation protocol into a joint-measurement surface-code layout using smaller patches, claimed to cut spatial cost versus Gidney-Fowler while preserving leading-order error suppression and single-fault detection.
-
Parallelizing Large-Scale Tensor Network Contraction on Multiple GPUs
A communication-aware multi-GPU distribution approach for tensor network contraction reports 7-173x extra speedup over slicing on 8 H100 GPUs and 42x to 67,869x on 1024 GPUs.
-
Sparse Mamba Decoder for Quantum Error Correction: Efficient Defect-Centric Processing of Surface Code Syndromes
Sparse Mamba Decoder processes only active defects in surface code syndromes using a 13-feature representation and Mamba backbone for O(k) complexity, reporting speedups and accuracy gains over dense decoders.
-
Linear-Time T-Gate Optimization via Random Abstraction
A linear-time randomized static analysis that propagates constant-width bitstrings enables phase folding and T-count optimization matching SOTA tools on large circuits.
-
Price and Payoff: Non-Determinism in Fault Tolerant Quantum Computation
Stochastic magic-state production in fault-tolerant quantum computing inflates execution time but reduces peak resource demand, allowing stochastic-aware factory allocation to cut space-time volume by up to 27% and factories by up to 30% versus deterministic optima.
-
Closed form logical error rate approximations for surface codes
Symmetry counting of error configurations yields closed-form approximations for logical error rates in surface codes.
-
MCMit: Mid-Circuit Measurement Error Mitigation
MCMit proposes a constant-latency multi-control branch instruction, transformer and CNN discriminators, plus static MCM elimination and stochastic branching, evaluated on Qubic with QPU traces to cut latency by 70% and logical error rates by up to 9.4x.
-
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization
A logarithmic HUBO encoding with a lexicographic penalty solves minimum graph coloring and related partition-count problems using exponentially fewer qubits per vertex than one-hot encoding.
-
Orkan: Cache-friendly simulation of quantum operations on hermitian operators
Orkan simulates quantum operations on Hermitian operators using a cache-friendly tiled lower-triangle layout, halving memory and achieving 2-4x speedups over Qiskit Aer, QuEST, and Qulacs.
-
When is randomization advantageous in quantum simulation?
Randomized sparse-QSVT reduces gate counts by up to 10x for inhomogeneous many-term Hamiltonians at moderate error (around 10^{-3}), but deterministic QSVT becomes cheaper for higher precision.
-
Database Reordering for Compact Grover Oracles with ESOP Minimization
Reordering database addresses before ESOP minimization produces smaller QROM circuits for Grover oracles, with simulated annealing yielding roughly 30% size reduction over fixed ordering for small N.
-
Space-Efficient Quantum Algorithm for Elliptic Curve Discrete Logarithms with Resource Estimation
A space-efficient quantum ECDLP algorithm uses 5n + 4⌊log₂n⌋ + O(1) logical qubits and O(n³) Toffoli gates, lowering the 256-bit estimate from 2124 to 1333 qubits.
-
Universal Quantum Gate Set from Multiple-Braiding Sequences in $SU(2)_k$ ($k>2$, $k\neq 4$) Anyon Models
Multiple-braiding sequences with multiplicities up to nine in SU(2)_k anyon models enable approximation of a universal gate set {H, T, CNOT} for k>2, k≠4, with numerical evidence from genetic algorithms.
-
Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
-
Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation
A pipelined framework with speculation for logical operations in fault-tolerant quantum computation reduces total pipeline steps by 20-40% on benchmarks by overlapping control, execution, and decoding stages.
-
Characterization of nested Walsh parity-check filters in a single-photon eight-mode register on a cloud photonic processor
Experimental tests of parity-check filters in a single-photon eight-mode photonic register on Quandela's Belenos processor show mean 0.6% DC leakage with 21x suppression and 94-99% syndrome channel selectivity.
-
When Noisy Quantum Order Finding Remains Recoverable for Shor's Algorithm
Empirical study of real NISQ order-finding data identifies dominant verified mass fraction as the strongest predictor of whether standard post-processing recovers the true order.
-
Remote Entanglement in Lattice Surgery: To Distill, or Not to Distill
The work identifies a fidelity crossover separating distillation-dominated and no-distillation regimes for remote entanglement in lattice surgery, with up to 100x or >50% resource savings depending on the side of the threshold.
-
Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads
Three architectural types for fault-tolerant distributed quantum computing exhibit distinct scaling of Bell-pair consumption and generation attempts with code distance in planar surface and toric codes.
-
Quantum memory based on concatenating surface codes and quantum Hamming codes
Concatenating surface codes with quantum Hamming codes achieves high error thresholds up to the surface code limit and suppresses logical errors more effectively than surface codes with comparable overhead for intermediate-scale quantum memories.
-
Managing Classical Processing Requirements for Quantum Error Correction
A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.
-
Circuit-Level Noise Estimation via Shuttling in Plaquette Circuits
A method is developed for estimating QEC circuit-level noise from single-shot surface code plaquette experiments in FRESH and RECYCLE configurations, tested on IonQ and IBM hardware.
-
Gate Stack Engineering for High-Mobility and Low-Noise SiMOS Quantum Devices
Raising the atomic-layer deposition temperature of Al2O3 and using HfO2 or poly-Si gates in SiMOS devices correlates with higher mobility and lower charge noise, yielding more stable quantum dots.
-
Maximum Likelihood Decoding of Quantum Error Correction Codes
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
-
Quantum Complexity and New Directions in Nuclear Physics and High-Energy Physics Phenomenology
A review of how quantum information science is expected to provide new tools and insights for nuclear and high-energy physics phenomenology and quantum simulations.
-
The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
A synthesis of expert insights from the ADAC Quantum Computing Working Group and member survey on the complementary roles of quantum and classical high-performance computing in future hybrid infrastructures.
-
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.