Polynomial-time algorithms for the Polynomial Freiman-Ruzsa theorem and equivalent formulations over F_2^n, based on an optimized quadratic Goldreich-Levin procedure.
hub Mixed citations
Improved simulation of stabilizer circuits
Mixed citation behavior. Most common role is background (60%).
19
Pith papers citing it
1,127
external citations · Crossref
Background
60% of classified citations
hub tools
citation-role summary
background 3
method 2
citation-polarity summary
representative citing papers
A hardware-efficient binary-tree ansatz has a closed-form diagonal Fubini–Study metric, enabling metric-aware VQE and time evolution without auxiliary circuits, with linear-in-k pruning for sparse sectors.
A high-rate non-LDPC CSS code family with parameters [[n, √n, Θ(n^β)]] (β≈0.2823) is constructed from a base [[n0,2,d0]] code and provably admits a constant-depth complete transversal logical Clifford ISA of targeted S̄, √X̄, and CZ̄ gates.
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.
Zero-noise extrapolation has a finite-shot help-harm boundary below which it increases local mean-squared error due to variance penalties outweighing bias reduction.
A rubric-guided GRPO pipeline fine-tunes a 7B LLM to synthesize quantum circuits achieving 3.31x T-gate compression with <1% hardware-constraint violations, validated on IBM and IonQ processors.
cTJM combines local TDVP MPS gate evolution with variance-aware Pauli-Lindblad jump sampling, cutting trajectory variance and bond growth on noisy circuits up to 127 qubits.
Demonstration of utility-scale quantum simulation of collective dissipation in 1D qubit chains up to 86 emitters using Trotterized dynamic circuits, biased CDR error mitigation, and classical MC-TEBD validation on IBM hardware.
An exact path integral for finite-dimensional quantum mechanics in discrete phase space is derived, showing that full entanglement dynamics in qutrits requires all fluctuation sectors beyond mean-field.
MonteQ applies Monte Carlo Tree Search in a two-level framework to optimize Pauli rotation orderings for Hamiltonian simulation, cutting CNOT counts by up to 53% versus prior compilers.
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.
Morphing circuits optimize syndrome extraction for Abelian 2BGA and other QEC codes, yielding new circuits with improved parameters, connectivity, and stability against measurement errors.
Repurposing ancilla qubits for both magic-state cultivation and routing improves lattice-surgery schedule efficiency by 19-223% over dedicated-bus routing in simulations.
SAQR-QC is a new logic for scalable approximate quantitative reasoning about quantum circuits via local qubit operations and controlled precision loss, demonstrated on GHZ circuits and quantum phase estimation.
Objectivity emergence in quantum Darwinism is identified with algebraic local recoverability in quantum codes, yielding precise characterization for stabilizer codes.
The Shortest Path in Pauli Forest algorithm decomposes Pauli exponentials into quantum circuits with improved CNOT counts and runtime for random cases and molecular ansatze.
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.
citing papers explorer
-
An algorithmic Polynomial Freiman-Ruzsa theorem
Polynomial-time algorithms for the Polynomial Freiman-Ruzsa theorem and equivalent formulations over F_2^n, based on an optimized quadratic Goldreich-Levin procedure.
-
A hardware-efficient variational ansatz with an exact diagonal metric for real- and imaginary-time evolution and Haar sampling
A hardware-efficient binary-tree ansatz has a closed-form diagonal Fubini–Study metric, enabling metric-aware VQE and time evolution without auxiliary circuits, with linear-in-k pruning for sparse sectors.
-
Quantum Logic Codes: Complete Transversal Logical Clifford Instruction Sets for High-Rate Stabilizer Quantum Error Correcting Codes
A high-rate non-LDPC CSS code family with parameters [[n, √n, Θ(n^β)]] (β≈0.2823) is constructed from a base [[n0,2,d0]] code and provably admits a constant-depth complete transversal logical Clifford ISA of targeted S̄, √X̄, and CZ̄ gates.
-
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.
-
The finite-shot help-harm boundary of zero-noise extrapolation
Zero-noise extrapolation has a finite-shot help-harm boundary below which it increases local mean-squared error due to variance penalties outweighing bias reduction.
-
RubriQ: Rubric-Guided Group Relative Policy Optimization for Constraint-Aware Quantum Circuit Synthesis
A rubric-guided GRPO pipeline fine-tunes a 7B LLM to synthesize quantum circuits achieving 3.31x T-gate compression with <1% hardware-constraint violations, validated on IBM and IonQ processors.
-
Noisy quantum circuit simulation with the tensor jump method
cTJM combines local TDVP MPS gate evolution with variance-aware Pauli-Lindblad jump sampling, cutting trajectory variance and bond growth on noisy circuits up to 127 qubits.
-
Utility-scale quantum experiments using dynamic circuits to address collective dissipation in interacting qubits
Demonstration of utility-scale quantum simulation of collective dissipation in 1D qubit chains up to 86 emitters using Trotterized dynamic circuits, biased CDR error mitigation, and classical MC-TEBD validation on IBM hardware.
-
Path integral formulation of finite-dimensional quantum mechanics in discrete phase space
An exact path integral for finite-dimensional quantum mechanics in discrete phase space is derived, showing that full entanglement dynamics in qutrits requires all fluctuation sectors beyond mean-field.
-
MonteQ: A Monte Carlo Tree Search Based Quantum Circuit Synthesis Framework
MonteQ applies Monte Carlo Tree Search in a two-level framework to optimize Pauli rotation orderings for Hamiltonian simulation, cutting CNOT counts by up to 53% versus prior compilers.
-
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.
-
Optimising Quantum Error Correction Using Morphing Circuits
Morphing circuits optimize syndrome extraction for Abelian 2BGA and other QEC codes, yielding new circuits with improved parameters, connectivity, and stability against measurement errors.
-
PureMagic: A Dynamic Scheduler for Lattice Surgery
Repurposing ancilla qubits for both magic-state cultivation and routing improves lattice-surgery schedule efficiency by 19-223% over dedicated-bus routing in simulations.
-
SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits
SAQR-QC is a new logic for scalable approximate quantitative reasoning about quantum circuits via local qubit operations and controlled precision loss, demonstrated on GHZ circuits and quantum phase estimation.
-
Demystifying Objectivity with Operator Algebra Quantum Error Correction
Objectivity emergence in quantum Darwinism is identified with algebraic local recoverability in quantum codes, yielding precise characterization for stabilizer codes.
-
Shortest Path in Pauli Forest -- An Algorithm for Decomposing Pauli Exponentials to Quantum Circuits
The Shortest Path in Pauli Forest algorithm decomposes Pauli exponentials into quantum circuits with improved CNOT counts and runtime for random cases and molecular ansatze.
-
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.
- Invariant Measures and Weak-Magic-Injection Asymptotics in Random Monitored Quantum Circuits