A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.
Efficient implementation of multi-controlled quantum gates
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
Replaces sampling-based estimation in NOQE with iterative quantum amplitude estimation to achieve O(1/ε) query complexity for Hamiltonian and overlap matrices.
Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.
citing papers explorer
-
Efficient Simulation of High-Level Quantum Gates
A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.
-
Towards Heisenberg Scaling: Measurement-Efficient Non-Orthogonal Quantum Eigensolver
Replaces sampling-based estimation in NOQE with iterative quantum amplitude estimation to achieve O(1/ε) query complexity for Hamiltonian and overlap matrices.
-
Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors
Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.