Clifford+T synthesis for small-angle rotations reduces T-cost to ~O(θ²/δ) and makes Trotterization cost constant in the small-step limit.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 5years
2026 5roles
background 1polarities
background 1representative citing papers
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
No-go theorems prove hierarchy level and state-independent sequences cannot maximize operational magic in early FTQC, requiring state-aware differentiable optimization and nonlinear phases for scalable magic generation.
Trotter error cancellation in nanographene simulations reduces circuit depth by about 10x for quantum phase estimation of energy gaps to chemical accuracy in the Pariser-Parr-Pople model.
An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for quantum and classical interconnects.
citing papers explorer
-
More efficient Clifford+T synthesis for small-angle rotations and application to Trotterization
Clifford+T synthesis for small-angle rotations reduces T-cost to ~O(θ²/δ) and makes Trotterization cost constant in the small-step limit.
-
Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
-
Quantum Magic in early FTQC: From Diagonal Clifford Hierarchy No-Go Theorems to Architecture Design Blueprints
No-go theorems prove hierarchy level and state-independent sequences cannot maximize operational magic in early FTQC, requiring state-aware differentiable optimization and nonlinear phases for scalable magic generation.
-
Quantum simulation of nanographenes and Trotter error cancellation
Trotter error cancellation in nanographene simulations reduces circuit depth by about 10x for quantum phase estimation of energy gaps to chemical accuracy in the Pariser-Parr-Pople model.
-
Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers
An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for quantum and classical interconnects.