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
Universal quantum computation with ideal clifford gates and noisy ancillas
23 Pith papers cite this work. Polarity classification is still indexing.
23
Pith papers citing it
hub tools
citation-role summary
background 2
other 1
citation-polarity summary
representative citing papers
Proves unique stationary law for Clifford random monitored quantum circuits and computes leading asymptotics of steady magic, linear for odd-prime dimension mana and quadratic for qubit 2-stabilizer Rényi entropy.
Under local amplitude damping, GHZ-type states lose magic, regain it after entanglement death, and the rebirth threshold exactly mirrors the entanglement-death threshold: γ₊ = 1 − γₑ for every n.
Equivariant RL agent synthesizes near-optimal Clifford circuits up to 30 qubits with lower two-qubit gate counts than Qiskit baselines.
Hermitian weighted graphs enable universal exact realization of arbitrary complex QL-bits as real-spectrum eigenstates, with discrete {0, ±1, ±i} couplings dense in the state space.
Logical error rates in [[7,1,3]] and [[12,2,4]] codes are suppressed 9.8-800 times below physical rates on trapped-ion hardware, with repeated correction cycles approaching the error rate of two physical CNOTs.
Hardware experiment on IBM devices shows reset-free LUCI achieves logical X and Z error suppression ratios of 1.75(10) and 1.93(12), competitive with surface code despite halved syndrome density.
The paper proposes an eigenstate filtering (EF) variant of quantum inverse power iteration (QIPI) that uses symmetric QSVT polynomials to robustly target excited states, showing better convergence than Chebyshev or Fourier approaches on H2, LiH, and BeH2.
k-local quantum Hamiltonians admit system-size-independent spectral gap for Gibbs samplers at high temperature, enabling FPT quantum approximation algorithms for partition functions.
Pure-state BNMR is an intrinsic function of the nonzero Schmidt spectrum via dimension reduction, yielding quadratic perturbation response, Haar-random profiles localized at symmetric cuts, and closed forms for rank-2 states.
A family of positive semidefinite operators is introduced that witnesses arbitrary logical GKP qubit states and enables their efficient characterization via three quadrature measurements.
O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.
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.
Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.
Postselection on typical syndromes in the toric code suppresses logical error rates from p_f to p_f^b with b approximately 3.1 via large-deviation arguments.
Introduces permutation-agnostic distance measures to quantify non-stabiliserness consumption and shows structured variational methods use it more efficiently than unstructured ones with greater classical optimisation freedom.
Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above prior values.
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
Within a restricted low-energy spin-sector ansatz for n-p scattering, direction-averaged magic is locally minimized at the CP-conserving point heta-bar=0 when the effective phase equals heta/4 or lies in specific windows.
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.
Qubit allocation techniques for distributed color-code logical qubits achieve a 10% reduction in nonlocal gates that scales with more qubits, plus evaluations of methods for universal gate sets including a logical-swaps approach.
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
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.
-
Invariant Measures and Weak-Magic-Injection Asymptotics in Random Monitored Quantum Circuits
Proves unique stationary law for Clifford random monitored quantum circuits and computes leading asymptotics of steady magic, linear for odd-prime dimension mana and quadratic for qubit 2-stabilizer Rényi entropy.
-
Sudden death of entanglement, rebirth of magic
Under local amplitude damping, GHZ-type states lose magic, regain it after entanglement death, and the rebirth threshold exactly mirrors the entanglement-death threshold: γ₊ = 1 − γₑ for every n.
-
Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis
Equivariant RL agent synthesizes near-optimal Clifford circuits up to 30 qubits with lower two-qubit gate counts than Qiskit baselines.
-
Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs
Hermitian weighted graphs enable universal exact realization of arbitrary complex QL-bits as real-spectrum eigenstates, with discrete {0, ±1, ±i} couplings dense in the state space.
-
Demonstration of logical qubits and repeated error correction with better-than-physical error rates
Logical error rates in [[7,1,3]] and [[12,2,4]] codes are suppressed 9.8-800 times below physical rates on trapped-ion hardware, with repeated correction cycles approaching the error rate of two physical CNOTs.
-
LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density
Hardware experiment on IBM devices shows reset-free LUCI achieves logical X and Z error suppression ratios of 1.75(10) and 1.93(12), competitive with surface code despite halved syndrome density.
-
Efficient targeting of arbitrary excited states with quantum inverse power iteration through filtering polynomials
The paper proposes an eigenstate filtering (EF) variant of quantum inverse power iteration (QIPI) that uses symmetric QSVT polynomials to robustly target excited states, showing better convergence than Chebyshev or Fourier approaches on H2, LiH, and BeH2.
-
Fast mixing of all-to-all quantum systems at high temperatures
k-local quantum Hamiltonians admit system-size-independent spectral gap for Gibbs samplers at high temperature, enabling FPT quantum approximation algorithms for partition functions.
-
Intrinsic spectral structure of bipartite nonlocal magic resource
Pure-state BNMR is an intrinsic function of the nonzero Schmidt spectrum via dimension reduction, yielding quadratic perturbation response, Haar-random profiles localized at symmetric cuts, and closed forms for rank-2 states.
-
Efficient characterization of general Gottesman-Kitaev-Preskill qubits
A family of positive semidefinite operators is introduced that witnesses arbitrary logical GKP qubit states and enables their efficient characterization via three quadrature measurements.
-
O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.
-
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.
-
Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation
Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.
-
Scalable accuracy gains from postselection in quantum error correcting codes
Postselection on typical syndromes in the toric code suppresses logical error rates from p_f to p_f^b with b approximately 3.1 via large-deviation arguments.
-
Geometric and Resource-Theoretic Characterisation of Non-Stabiliserness in Quantum Algorithms
Introduces permutation-agnostic distance measures to quantify non-stabiliserness consumption and shows structured variational methods use it more efficiently than unstructured ones with greater classical optimisation freedom.
-
Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above prior values.
-
Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
-
Local Minimum of Spin-Sector Magic at the CP-Conserving Point in Low-Energy Neutron-Proton Scattering
Within a restricted low-energy spin-sector ansatz for n-p scattering, direction-averaged magic is locally minimized at the CP-conserving point heta-bar=0 when the effective phase equals heta/4 or lies in specific windows.
-
Fire and ice: Partially fault-tolerant quantum computing with selective state filtering
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.
-
Near-Term Reduction in Nonlocal Gate Count from Distributed Logical Qubits
Qubit allocation techniques for distributed color-code logical qubits achieve a 10% reduction in nonlocal gates that scales with more qubits, plus evaluations of methods for universal gate sets including a logical-swaps approach.
-
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.
- A Deficiency-Based Approach for the Operational Interpretation of Quantum Resources with Applications