For PEPS with strong injectivity above a threshold, belief propagation finds fixed points efficiently and cluster-corrected BP approximates observables to 1/poly(N) error in poly(N) time, with local perturbations affecting the fixed point only locally.
hub Canonical reference
Lloyd, Universal quantum simulators, Science273, 1073 (1996)
Canonical reference. 100% of citing Pith papers cite this work as background.
36
Pith papers citing it
Background
100% of classified citations
hub tools
citation-role summary
background 6
citation-polarity summary
fields
quant-ph 36roles
background 6polarities
background 6representative citing papers
Develops practical scalable protocols to upper-bound total variation distance for quantum circuits with non-Clifford two-qubit gates and generalizes Pauli twirling to non-Pauli bases.
The conjecture that breaking all non-trivial graph automorphisms suffices for universality in globally controlled qubit systems is disproved by connected graphs with trivial automorphism groups whose generated Lie algebras are nonetheless non-universal.
Entanglement entropy bounds the variance of Trotter error downward, and magic drives the error kurtosis downward (Kur = α + βM, β<0 for large systems).
Riemannian modified Newton optimization on quantum search achieves quadratic convergence and O(√(N/M) log log(1/ε)) complexity when M/N is known.
Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
A fluctuation-guided adaptive random compiler for Hamiltonian simulation dynamically adjusts term sampling probabilities according to state sensitivity to improve fidelity over fixed randomized methods.
First end-to-end demonstration of quantum error correction integrated with quantum phase estimation to compute molecular hydrogen ground-state energy to 0.001(13) hartree accuracy on Quantinuum H2-2 hardware.
Under Floquet ETH, the trace distance between energy-filtered and thermal states is bounded by O(√δ), where δ is the filter width.
Pi-QEM selects dominant low-weight Pauli strings for ML training in quantum error mitigation, reducing ground-state energy estimation error by up to 34.01% using a single observable in molecular simulations on noisy IBM backends.
An adiabatic protocol for quantum phase estimation that reaches optimal scaling T = O(1/ε log(1/δ)) by encoding eigenvalues in computational basis populations rather than phases.
Optimized non-uniform shot allocation guided by an equation-of-motion error cost function reduces measurement overhead by >2x and improves fidelity in noisy imaginary-time VQDS for 1D Ising ground states.
An FPGA-based neural-network decoder achieves 550 ns deterministic closed-loop latency for real-time distance-3 surface code error correction on a superconducting processor, matching offline decoding performance.
For diagonal quadratic evolutions, qubit encodings are asymptotically cheaper than qudit encodings in both Trotter and LCU settings, but small-dimension qudits can win under favorable synthesis or code-switching assumptions.
Structure-aware approximate compilation for Hamiltonian dynamics on NISQ devices produces shallower circuits with higher observed fidelity than generic exact synthesis.
Forward–reverse evolution, Richardson extrapolation, and runtime randomization cancel the leading O(T^{-1}) adiabatic phase error in Berry phase estimation, yielding O(ε^{-3/2}) total cost (QPE) or Θ(ε^{-1/3}) coherent runtime (Hadamard test).
Tensor network simulations act as effective surrogate models for training QAOA on large 2D lattices, overcoming limits of parameter transfer from small instances and remaining classically feasible with moderate bond dimensions.
A method using dressed creation operators from MLWFs enables selective preparation and detection of quasiparticles in lattice theories, tested via MPS on hardcore QCD ladders to separate known excitations from resonances.
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.
QFTLM computes thermal expectation values on quantum computers by merging quantum Krylov methods with efficient typical-state preparation for trace estimation.
A single-ancilla Power-Cosine QSP filter on time-evolution operators achieves deterministic many-body ground state preparation with exponential excited-state suppression and O(Δ^{-2} log(1/ε)) depth scaling.
A new encoding scheme for exp(-iθP) into stabilizer codes like [[n,n-2,2]] and [[5,1,3]] achieves 4-7x lower noise than unencoded versions with at most 3% runs discarded after postselection.
Mixing time of Lindblad-governed open quantum systems is determined by the Liouvillian gap plus trace-norm factors of eigenmodes, yielding rapid mixing conditions via sparsity constraints on the Hamiltonian and local Lindblad operators.
Orthogonal FDM with rectangular pulses suppresses interference to enable high-fidelity simultaneous gates on multiple qubits via a single microwave line.
citing papers explorer
-
Algorithmic Locality via Provable Convergence in Quantum Tensor Networks
For PEPS with strong injectivity above a threshold, belief propagation finds fixed points efficiently and cluster-corrected BP approximates observables to 1/poly(N) error in poly(N) time, with local perturbations affecting the fixed point only locally.
-
Quantum Accreditation with Non-Clifford Two-qubit Gates
Develops practical scalable protocols to upper-bound total variation distance for quantum circuits with non-Clifford two-qubit gates and generalizes Pauli twirling to non-Pauli bases.
-
Obstructions to universality in globally controlled qubit graphs
The conjecture that breaking all non-trivial graph automorphisms suffices for universality in globally controlled qubit systems is disproved by connected graphs with trivial automorphism groups whose generated Lie algebras are nonetheless non-universal.
-
Taming Trotter Errors with Quantum Resources
Entanglement entropy bounds the variance of Trotter error downward, and magic drives the error kurtosis downward (Kur = α + βM, β<0 for large systems).
-
Achieving double-logarithmic precision dependence in optimization-based quantum unstructured search
Riemannian modified Newton optimization on quantum search achieves quadratic convergence and O(√(N/M) log log(1/ε)) complexity when M/N is known.
-
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
-
Fluctuation-guided adaptive random compiler for Hamiltonian simulation
A fluctuation-guided adaptive random compiler for Hamiltonian simulation dynamically adjusts term sampling probabilities according to state sensitivity to improve fidelity over fixed randomized methods.
-
Quantum Error-Corrected Computation of Molecular Energies
First end-to-end demonstration of quantum error correction integrated with quantum phase estimation to compute molecular hydrogen ground-state energy to 0.001(13) hartree accuracy on Quantinuum H2-2 hardware.
-
How thermal is a filtered state?
Under Floquet ETH, the trace distance between energy-filtered and thermal states is bounded by O(√δ), where δ is the filter width.
-
Pauli Weight Hamiltonian Term Selection for Optimized Machine Learning Based Quantum Error Mitigation
Pi-QEM selects dominant low-weight Pauli strings for ML training in quantum error mitigation, reducing ground-state energy estimation error by up to 34.01% using a single observable in molecular simulations on noisy IBM backends.
-
Adiabatic Quantum Phase Estimation
An adiabatic protocol for quantum phase estimation that reaches optimal scaling T = O(1/ε log(1/δ)) by encoding eigenvalues in computational basis populations rather than phases.
-
Sampling Noise and Optimized Measurement Distribution in Imaginary-Time Quantum Dynamics Simulations
Optimized non-uniform shot allocation guided by an equation-of-motion error cost function reduces measurement overhead by >2x and improves fidelity in noisy imaginary-time VQDS for 1D Ising ground states.
-
Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder
An FPGA-based neural-network decoder achieves 550 ns deterministic closed-loop latency for real-time distance-3 surface code error correction on a superconducting processor, matching offline decoding performance.
-
Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators
For diagonal quadratic evolutions, qubit encodings are asymptotically cheaper than qudit encodings in both Trotter and LCU settings, but small-dimension qudits can win under favorable synthesis or code-switching assumptions.
-
Hardware-Efficient Hamiltonian Simulation via Trotter-Initialized Variational Optimization with Native Placement
Structure-aware approximate compilation for Hamiltonian dynamics on NISQ devices produces shallower circuits with higher observed fidelity than generic exact synthesis.
-
Adiabatic Error Cancellation in Berry Phase Estimation
Forward–reverse evolution, Richardson extrapolation, and runtime randomization cancel the leading O(T^{-1}) adiabatic phase error in Berry phase estimation, yielding O(ε^{-3/2}) total cost (QPE) or Θ(ε^{-1/3}) coherent runtime (Hadamard test).
-
Tensor network surrogate models for variational quantum computation
Tensor network simulations act as effective surrogate models for training QAOA on large 2D lattices, overcoming limits of parameter transfer from small instances and remaining classically feasible with moderate bond dimensions.
-
Preparation and detection of quasiparticles for quantum simulations of scattering
A method using dressed creation operators from MLWFs enables selective preparation and detection of quasiparticles in lattice theories, tested via MPS on hardcore QCD ladders to separate known excitations from resonances.
-
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.
-
Quantum Finite Temperature Lanczos Method
QFTLM computes thermal expectation values on quantum computers by merging quantum Krylov methods with efficient typical-state preparation for trace estimation.
-
Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators
A single-ancilla Power-Cosine QSP filter on time-evolution operators achieves deterministic many-body ground state preparation with exponential excited-state suppression and O(Δ^{-2} log(1/ε)) depth scaling.
-
Protection of Exponential Operation using Stabilizer Codes in the Early Fault Tolerance Era
A new encoding scheme for exp(-iθP) into stabilizer codes like [[n,n-2,2]] and [[5,1,3]] achieves 4-7x lower noise than unencoded versions with at most 3% runs discarded after postselection.
-
Universal Predictors for Mixing Time more than Liouvillian Gap
Mixing time of Lindblad-governed open quantum systems is determined by the Liouvillian gap plus trace-norm factors of eigenmodes, yielding rapid mixing conditions via sparsity constraints on the Hamiltonian and local Lindblad operators.
-
Orthogonal frequency-division multiplexing for simultaneous gate operations on multiple qubits via a shared control line
Orthogonal FDM with rectangular pulses suppresses interference to enable high-fidelity simultaneous gates on multiple qubits via a single microwave line.
-
Fault-Tolerant Encoding of Logical Qudits in Spin Systems
Constructs distance-3, distance-5, and general 2t+1 logical qudit codes in spin systems with smaller Hilbert-space dimension than qubit-based encodings and polynomial scaling for operations.
-
Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems
Benchmarks gradient-ascent algorithms for constrained free energy minimization on quantum Heisenberg models and stabilizer codes, with applications to thermal state design and fixed-temperature quantum encoding.
-
Quantum Reservoir Computing for Realized Volatility Forecasting
Quantum reservoir computing using a fully connected transverse-field Ising model with input and memory qubits outperforms econometric and standard ML benchmarks in realized volatility forecasting.
-
Quantum Algorithms for Simulating Nuclear Effective Field Theories
Resource estimates for quantum simulation of pionless and pionful nuclear lattice EFTs, including time evolution and energy estimation, with new error bounds from symmetries and locality yielding orders-of-magnitude improvements for the pionless case.
-
Learning Low-Energy Subspace Overlaps in Many-Body Systems with Measurement-Based and Coherent Quantum Strategies
Compares shadow-based CNNs and physics-informed QCNNs for predicting low-energy subspace overlaps in quenched 10-qubit Heisenberg chains, reporting regime-dependent R^2 performance with QCNNs more stable overall.
-
Preparing thermal states of frustrated quantum spin systems using 139 qubits
Dissipative protocols on quantum hardware prepare approximate thermal states for kagome AFIM up to 79 sites and AFHM via simulation, with circuit depth independent of size and linear in inverse temperature.
-
Matrix Product Operator Encodings of the Magnus Expansion and Dyson Series
MPO encodings of the Magnus expansion and Dyson series for accurate time evolution of time-dependent 1D quantum Hamiltonians on finite or infinite lattices with long-range interactions.
-
Getting large-scale quantum neural networks ready for quantum hardware
Physics-informed quantum neural networks trained on noisy measurements can construct nontrivial decision boundaries to classify quantum states via order parameters and are suited for NISQ hardware due to links with Markovian open many-body systems.
-
Trade-off between complexity and energy in quantum phase estimation
A new framework establishes a trade-off between energy cost and complexity in quantum phase estimation, locating a sweet spot for co-optimization at desired precision.
-
QuTiP 5: The Quantum Toolbox in Python
QuTiP 5 updates the Quantum Toolbox in Python with data layer changes for JAX and CuPy support, new solvers, QuTiP-QIP for circuits, and QuTiP-QOC for control.
-
Beyond Unitary Quantum Simulation: Open-System Approaches to Quantum Chemistry toward Quantum Advantage
Review arguing that open-system approaches integrating dissipation into quantum chemistry simulations on fault-tolerant computers offer practical advantages for robustness and potential quantum advantage over purely unitary methods.
-
Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent
AL-QHD benchmarks on nonconvex test functions and ACOPF power problems show useful accuracy at fixed qubit cost but require roughly 10^8 T gates for realistic instances.