Techniques to Reduce $\pi/4$-Parity-Phase Circuits, Motivated by the ZX Calculus
暂无分享,去创建一个
[1] Dmitri Maslov,et al. Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning , 2013, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[2] Lucas Dixon,et al. Graphical reasoning in compact closed categories for quantum computation , 2009, Annals of Mathematics and Artificial Intelligence.
[3] Cody Jones,et al. Low-overhead constructions for the fault-tolerant Toffoli gate , 2012, 1212.5069.
[4] Daniel Litinski,et al. Braiding by Majorana tracking and long-range CNOT gates with color codes , 2017, 1708.05012.
[5] Peter Selinger,et al. Proceedings of the 15th International Conference on Quantum Physics and Logic , 2019 .
[6] Daniel Litinski,et al. A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery , 2018, Quantum.
[7] Fang Zhang,et al. Optimizing T gates in Clifford+T circuit as $\pi/4$ rotations around Paulis , 2019, 1903.12456.
[8] Mark Howard,et al. Qudit versions of the qubit "pi-over-eight" gate , 2012, 1206.1598.
[9] P. Selinger. A Survey of Graphical Languages for Monoidal Categories , 2009, 0908.3347.
[10] Jianxin Chen,et al. A finite presentation of CNOT-dihedral operators , 2016, QPL.
[11] Simon Perdrix,et al. Rewriting Measurement-Based Quantum Computations with Generalised Flow , 2010, ICALP.
[12] Simon J. Devitt,et al. Surface code implementation of block code state distillation , 2013, Scientific Reports.
[13] Earl T. Campbell,et al. Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost , 2016, 1606.01904.
[14] Craig Gidney,et al. Halving the cost of quantum addition , 2017, Quantum.
[15] Malte Schlosser,et al. Scalable architecture for quantum information processing with atoms in optical micro-structures , 2011, Quantum Inf. Process..
[16] Giovanni De Micheli,et al. The Role of Multiplicative Complexity in Compiling Low $T$-count Oracle Circuits , 2019, 2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).
[17] Michele Mosca,et al. An algorithm for the T-count , 2013, Quantum Inf. Comput..
[18] Aleks Kissinger,et al. Reducing T-count with the ZX-calculus , 2019, 1903.10477.
[19] Aleks Kissinger,et al. Reducing the number of non-Clifford gates in quantum circuits , 2020, Physical Review A.
[20] M. Mosca,et al. A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[21] Michele Mosca,et al. T-Count Optimization and Reed–Muller Codes , 2016, IEEE Transactions on Information Theory.
[22] Earl T. Campbell,et al. An efficient quantum compiler that reduces T count , 2017, Quantum Science and Technology.
[23] Matthew Amy,et al. Towards Large-scale Functional Verification of Universal Quantum Circuits , 2018, QPL.
[24] Dmitri Maslov,et al. Shorter Stabilizer Circuits via Bruhat Decomposition and Quantum Circuit Transformations , 2017, IEEE Transactions on Information Theory.