Toric code decodability under coherent X/Z errors is dual to Majorana monitored dynamics whose symmetry class (D or DIII) dictates whether the generic transition is a measurement-induced entanglement transition or a topological transition between area-law phases.
hub Canonical reference
Abanin, Laleh Aghababaie-Beni, Igor Aleiner, Trond I
Canonical reference. 100% of citing Pith papers cite this work as background.
38
Pith papers citing it
598
external citations · Crossref
Background
100% of classified citations
hub tools
citation-role summary
background 7
citation-polarity summary
roles
background 7polarities
background 7representative citing papers
Protocol learns single-qubit Z-twirled MCM instrument parameters from three repeated measurements on mixed input, yielding ~100x better Pauli-observable prediction than confusion-matrix models on IBM processors.
A classical polynomial-time algorithm for optimized sampling of lottery tickets in neural networks removes the exponential dependence on data dimension from prior classical approaches.
An automated predecoder generator for arbitrary qLDPC codes cuts decoder utilization by up to 3963x and supports hardware scaling to tens or hundreds of thousands of logical qubits within power limits.
First experimental demonstration of memory-assisted on-demand multimode microwave-to-optical transduction with 0.3-0.4 noise photons at 460-620 microsecond storage in a 171Yb3+:Y2SiO5 crystal at 30 mK.
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
Nielsen quantum circuit complexity is positioned as a topological distance for unsupervised learning of topological order, with theorems linking it to Bures distance and entanglement to yield practical fidelity- and entanglement-based kernels demonstrated on XXZ chains and toric code.
Experimental preparation of topologically nontrivial critical states of the cluster Ising model on a 100-qubit superconducting processor, verified by boundary g-function and two-fold entanglement spectrum degeneracy under periodic boundaries.
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
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.
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.
The work constructs a permutation-equivariant quantum GNN that implements message passing at selectable Weisfeiler-Leman levels, supports pre-training on small graphs, and demonstrates readout scalability with simulations up to 56 qubits on synthetic, molecular, and TSP datasets.
First demonstration of stable bidirectional microwave-optical transduction in thin-film lithium tantalate with ~1 kHz coupling rates, multi-day static-bias operation, and low added noise.
Presents a coset ensemble decoder with algorithm-hardware co-design that claims better accuracy-latency trade-off and lower FPGA resource use than MWPM and UF baselines under depolarizing noise.
Barbell codes are a family of qLDPC codes with a matching superconducting chip layout enabling constant hardware complexity, simulated to preserve logical information over trillions of QEC cycles at 10^{-4} physical noise with under 30 data qubits per logical qubit.
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.
Mid-circuit stabilizer verification in six-qubit GSE-encoded Clifford Trotter steps reduces logical error rates by up to 54% on Barium ion hardware, with the gain vanishing if checks are deferred to circuit end.
Stabilizer redundancy from error-correcting codes reduces the choice of physical operators for a logical target to a least-squares problem with closed-form solution, allowing native hardware Hamiltonians to replace costly swaps.
HAML meta-learns a mapping from control inputs and device parameters to effective two-qubit Hamiltonian coefficients via simulation training, then adapts online with few measurements, recovering coefficients where Schrieffer-Wolff perturbation theory fails.
GreenPeas delivers a just-in-time GPU compiler for decoding hypergraphs that achieves >10x speedup on surface and bivariate bicycle codes, unlocking circuit-level decoding for adaptive quantum error correction.
An auxiliary-fermion encoding removes Jordan-Wigner strings for sparse non-local fermion models, achieving asymptotically optimal Trotter circuit depth on qubits after one-time state preparation.
A resource estimation framework for distributed fault-tolerant quantum computers based on lattice surgery identifies feasible hardware configurations for eight applications across thousands of setups, showing that architecture design must be guided by resource analysis for scalability.
Reservoir computing using polynomial features from measurement signals achieves up to 50% error reduction on single-qubit and 11% on five-qubit datasets with 100x fewer multiplications than neural networks while reducing crosstalk.
citing papers explorer
-
Decoding coherent errors in toric codes on honeycomb and square lattices: duality to Majorana monitored dynamics and symmetry classes
Toric code decodability under coherent X/Z errors is dual to Majorana monitored dynamics whose symmetry class (D or DIII) dictates whether the generic transition is a measurement-induced entanglement transition or a topological transition between area-law phases.
-
Learning Mid-circuit Measurement Backaction from Three Repeated Measurements
Protocol learns single-qubit Z-twirled MCM instrument parameters from three repeated measurements on mixed input, yielding ~100x better Pauli-observable prediction than confusion-matrix models on IBM processors.
-
Winning Lottery Tickets in Neural Networks via a Quantum-Inspired Classical Algorithm
A classical polynomial-time algorithm for optimized sampling of lottery tickets in neural networks removes the exponential dependence on data dimension from prior classical approaches.
-
Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding
An automated predecoder generator for arbitrary qLDPC codes cuts decoder utilization by up to 3963x and supports hardware scaling to tens or hundreds of thousands of logical qubits within power limits.
-
Memory-assisted multimode microwave-to-optical transduction
First experimental demonstration of memory-assisted on-demand multimode microwave-to-optical transduction with 0.3-0.4 noise photons at 460-620 microsecond storage in a 171Yb3+:Y2SiO5 crystal at 30 mK.
-
Hybrid Path-Sums for Hybrid Quantum Programs
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
-
Quantum circuit complexity and unsupervised machine learning of topological order
Nielsen quantum circuit complexity is positioned as a topological distance for unsupervised learning of topological order, with theorems linking it to Bures distance and entanglement to yield practical fidelity- and entanglement-based kernels demonstrated on XXZ chains and toric code.
-
Exploring nontrivial topology at quantum criticality in a superconducting processor
Experimental preparation of topologically nontrivial critical states of the cluster Ising model on a 100-qubit superconducting processor, verified by boundary g-function and two-fold entanglement spectrum degeneracy under periodic boundaries.
-
Fault-tolerant quantum computation with a neutral atom processor
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
-
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 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.
-
Scalable Message-Passing Quantum Graph Neural Networks in the Weisfeiler-Leman Hierarchy
The work constructs a permutation-equivariant quantum GNN that implements message passing at selectable Weisfeiler-Leman levels, supports pre-training on small graphs, and demonstrates readout scalability with simulations up to 56 qubits on synthetic, molecular, and TSP datasets.
-
Stable, bidirectional electro-optic transduction in thin film lithium tantalate
First demonstration of stable bidirectional microwave-optical transduction in thin-film lithium tantalate with ~1 kHz coupling rates, multi-day static-bias operation, and low added noise.
-
Coset Ensemble Decoder for Quantum Error Correction with Algorithm-Hardware Co-Design
Presents a coset ensemble decoder with algorithm-hardware co-design that claims better accuracy-latency trade-off and lower FPGA resource use than MWPM and UF baselines under depolarizing noise.
-
Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware
Barbell codes are a family of qLDPC codes with a matching superconducting chip layout enabling constant hardware complexity, simulated to preserve logical information over trillions of QEC cycles at 10^{-4} physical noise with under 30 data qubits per logical qubit.
-
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.
-
Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations
Mid-circuit stabilizer verification in six-qubit GSE-encoded Clifford Trotter steps reduces logical error rates by up to 54% on Barium ion hardware, with the gain vanishing if checks are deferred to circuit end.
-
Stabilizers for Compiling Logical Circuits under Hardware Constraints
Stabilizer redundancy from error-correcting codes reduces the choice of physical operators for a logical target to a least-squares problem with closed-form solution, allowing native hardware Hamiltonians to replace costly swaps.
-
Data-Driven Hamiltonian Reduction for Superconducting Qubits via Meta-Learning
HAML meta-learns a mapping from control inputs and device parameters to effective two-qubit Hamiltonian coefficients via simulation training, then adapts online with few measurements, recovering coefficients where Schrieffer-Wolff perturbation theory fails.
-
GreenPeas: Unlocking Adaptive Quantum Error Correction with Just-in-Time Decoding Hypergraphs
GreenPeas delivers a just-in-time GPU compiler for decoding hypergraphs that achieves >10x speedup on surface and bivariate bicycle codes, unlocking circuit-level decoding for adaptive quantum error correction.
-
Efficient Simulation of Sparse, Non-Local Fermion Models
An auxiliary-fermion encoding removes Jordan-Wigner strings for sparse non-local fermion models, achieving asymptotically optimal Trotter circuit depth on qubits after one-time state preparation.
-
Architecting Distributed Quantum Computers: Design Insights from Resource Estimation
A resource estimation framework for distributed fault-tolerant quantum computers based on lattice surgery identifies feasible hardware configurations for eight applications across thousands of setups, showing that architecture design must be guided by resource analysis for scalability.
-
Superconducting Qubit Readout Using Next-Generation Reservoir Computing
Reservoir computing using polynomial features from measurement signals achieves up to 50% error reduction on single-qubit and 11% on five-qubit datasets with 100x fewer multiplications than neural networks while reducing crosstalk.
-
Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation
SNT merges SV and PEC for subspace-tailored error mitigation in Trotterized FHM simulations, mapping out optimal combinations by hardware quality and shot budget while quantifying when noisy devices could surpass classical methods.
-
Bayesian Parameter Shift Rule in Variational Quantum Eigensolvers
Bayesian PSR with Gaussian processes and GradCoRe accelerates VQE SGD by reusing observations and minimizing per-step costs while reducing to standard PSR in special cases.
-
An Al$^+$ clock with $1.6\times10^{-18}$ systematic uncertainty and its frequency ratios
An Al+ single-ion clock is evaluated at 1.6×10^{-18} systematic uncertainty with absolute frequency 1121015393207859.19(24) Hz and ratio to Sr clock of 2.611701431781462668(36).
-
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.
-
Effect of isotropic errors on the complexity of Grover's algorithm
Numerical simulations indicate isotropic errors degrade Grover's algorithm performance and success probability on noisy quantum hardware.
-
Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework
QADR decomposes n-qubit VQCs into local sub-circuits to reduce memory from O(2^n) to O(n * 2^{2d+1}) and mitigate barren plateaus, scaling to 2000 features on MNIST and wind turbine diagnostics while matching classical models.
-
Analog photonic simulator for large-scale transport
Continuous-variable photonic platform with 20,000-mode cluster state simulates advection transport equation, achieving relative errors of 0.8% and 0.92% on first- and second-order moments via homodyne readout.
-
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.
-
Large-Scale Quantum Circuit Simulation on an Exascale System for QPU Benchmarking
Exascale classical simulation validates noise-tolerant performance of a 98-qubit QPU up to 48 qubits for LR-QAOA, with statistical analysis showing coherent regime up to 93 qubits before outputs become indistinguishable from random.
-
A Hybrid Quantum-Classical Approach for Melt Pool Prediction in Laser Powder Bed Fusion
Hybrid quantum-classical model with quantum feature encoding and clustering outperforms classical neural networks for LPBF melt pool prediction.
-
Probing the Planck scale with quantum computation
A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.
-
What quantum computer to buy?
Most institutions should start with the smallest quantum capability layer that delivers repeatable near-term value and builds expertise rather than acquiring large on-premises systems.
-
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.
-
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.