A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
Abstract We investigate the problem of synthesizing T-depth optimal quantum circuits for exactly implementable unitaries over the Clifford+T gate set. We construct a subset, $${{\mathbb{V}}}_{n}$$ V n , of T-depth 1 unitaries. T-depth-optimal decomposition of unitary U is $${e}^{i\phi }\left({\prod...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2022-09-01
|
| Series: | npj Quantum Information |
| Online Access: | https://doi.org/10.1038/s41534-022-00624-1 |