Techniques to Reduce $\pi/4$-Parity-Phase Circuits, Motivated by the ZX Calculus

In: Proceedings of QPL 2018

Original

Matthew Amy (2018): Towards Large-scale Functional Verification of Universal Quantum Circuits · 1901

Earlier work this paper cites.

[arXiv:1903.10477]

Original

Aleks Kissinger & John van de Wetering (2019): Reducing T-count with the ZX-calculus · 1903

Earlier work this paper cites.

[arXiv:1903.12456]

Original

Fang Zhang & Jianxin Chen (2019): Optimizing T gates in Clifford+T circuit as π / 4 \pi/4 rotations around Paulis · 1903

Earlier work this paper cites.

[arXiv:1908.01609]

Original

Giulia Meuli, Mathias Soeken, Earl Campbell, Martin Roetteler & Giovanni De Micheli (2019): The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits · 1908

Earlier work this paper cites.

In Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide & Paul G. Spirakis, editors: Automata, Languages and Programming

Ross Duncan & Simon Perdrix (2010): Rewriting Measurement-Based Quantum Computations with Generalised Flow · 2010

Earlier work this paper cites.

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Original

Matthew Amy, Dmitri Maslov, Michele Mosca & Martin Roetteler (2013): A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits · 2013

Cited alongside, same era.

Phys. Rev. A

Original

Cody Jones (2013): Low-overhead constructions for the fault-tolerant Toffoli gate · 2013

Cited alongside, same era.

Quantum Info. Comput

Original

David Gosset, Vadym Kliuchnikov, Michele Mosca & Vincent Russo (2014): An Algorithm for the T-count · 2014

Cited alongside, same era.

Physical Review A

Original

Earl T. Campbell & Mark Howard (2017): A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost · 2017

Cited alongside, same era.

Quantum Science and Technology

Original

Luke E. Heyfron & Earl T. Campbell (2018): An efficient quantum compiler that reduces T count · 2018

Later among the works it cites.

IEEE Transactions on Information Theory

Original

Dmitri Maslov & Martin Roetteler (2018): Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations · 2018

Later among the works it cites.

IEEE Transactions on Information Theory

Original

Matthew Amy & Michele Mosca (2019): T-count optimization and Reed-Muller codes · 2019

Closest in time.

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Original

Matthew Amy, Dmitri Maslov & Michele Mosca (2014): Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning · 2042

Closest in time.