Simpler qudit flow definition yields O(n^3) flow-finding algorithm and flow-preserving operations for measurement-based quantum computing on prime-dimensional qudits.
Reducing the number of non-Clifford gates in quantum circuits , volume =
5 Pith papers cite this work, alongside 161 external citations. Polarity classification is still indexing.
5
Pith papers citing it
161
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Graphical Algebraic Geometry creates universal diagrammatic languages for commutative algebras and affine varieties that also characterize the qudit ZH calculus for quantum computation.
Equivariant RL agent synthesizes near-optimal Clifford circuits up to 30 qubits with lower two-qubit gate counts than Qiskit baselines.
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
A linear-time randomized static analysis that propagates constant-width bitstrings enables phase folding and T-count optimization matching SOTA tools on large circuits.
citing papers explorer
-
Working with measurement-based computations on qudits
Simpler qudit flow definition yields O(n^3) flow-finding algorithm and flow-preserving operations for measurement-based quantum computing on prime-dimensional qudits.
-
Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi
Graphical Algebraic Geometry creates universal diagrammatic languages for commutative algebras and affine varieties that also characterize the qudit ZH calculus for quantum computation.
-
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.
-
Magic state cultivation: growing T states as cheap as CNOT gates
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
-
Linear-Time T-Gate Optimization via Random Abstraction
A linear-time randomized static analysis that propagates constant-width bitstrings enables phase folding and T-count optimization matching SOTA tools on large circuits.