In U(1)-symmetric random circuits, initial states with lower stabilizer Rényi entropy generate nonstabilizerness faster than those with higher entropy, with the effect also depending on spatial charge structure and extending to SU(2) circuits and Hamiltonian dynamics.
Litinski, Magic state distillation: Not as costly as you think, Quantum3, 205 (2019)
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
dataset 1
citation-polarity summary
fields
quant-ph 4years
2026 4verdicts
UNVERDICTED 4representative citing papers
A workload-aware surface-code architecture with ancilla-centric patches and T-gate-based floorplanning reduces required data tiles by up to 21% while maintaining near-optimal cycles per instruction and reaching 90% efficiency for 10 concurrent programs.
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 sites in one month using 10000 qubits.
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.
citing papers explorer
-
Nonstabilizerness Mpemba Effects
In U(1)-symmetric random circuits, initial states with lower stabilizer Rényi entropy generate nonstabilizerness faster than those with higher entropy, with the effect also depending on spatial charge structure and extending to SU(2) circuits and Hamiltonian dynamics.
-
Toward designing workload-aware Surface Code Architectures
A workload-aware surface-code architecture with ancilla-centric patches and T-gate-based floorplanning reduces required data tiles by up to 21% while maintaining near-optimal cycles per instruction and reaching 90% efficiency for 10 concurrent programs.
-
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 sites in one month using 10000 qubits.
-
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.