T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits.
Fault tolerant non-clifford state preparation for arbitrary rotations.arXiv preprint arXiv:2303.17380, 2023
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
A deterministic recursive quantum circuit prepares antisymmetric states for η fermions in N orbitals with O(η²√N) T-gates and O(√N) dirty ancillas, outperforming sorting methods for η ≲ √N.
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.
citing papers explorer
-
T Count as a Numerically Solvable Minimization Problem
T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits.
-
Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping
A deterministic recursive quantum circuit prepares antisymmetric states for η fermions in N orbitals with O(η²√N) T-gates and O(√N) dirty ancillas, outperforming sorting methods for η ≲ √N.
-
Fire and ice: Partially fault-tolerant quantum computing with selective state filtering
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.