Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities
暂无分享,去创建一个
[1] 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.
[2] Dmitri Maslov,et al. Automated optimization of large quantum circuits with continuous parameters , 2017, npj Quantum Information.
[3] Jianxin Chen,et al. A finite presentation of CNOT-dihedral operators , 2016, QPL.
[4] Earl T. Campbell,et al. Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost , 2016, 1606.01904.
[5] Aleks Kissinger,et al. Reducing the number of non-Clifford gates in quantum circuits , 2020, Physical Review A.
[6] David Gosset,et al. Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates. , 2016, Physical review letters.
[7] Aleks Kissinger,et al. Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus , 2019, Quantum.
[8] Craig Gidney,et al. Halving the cost of quantum addition , 2017, Quantum.
[9] Simon Perdrix,et al. Completeness of the ZX-Calculus , 2019, Log. Methods Comput. Sci..
[10] Austin G. Fowler,et al. Surface code quantum computing by lattice surgery , 2011, 1111.4022.
[11] Daniel Gottesman,et al. Stabilizer Codes and Quantum Error Correction , 1997, quant-ph/9705052.
[12] Earl T. Campbell,et al. An efficient quantum compiler that reduces T count , 2017, Quantum Science and Technology.
[13] Matthew Amy,et al. Towards Large-scale Functional Verification of Universal Quantum Circuits , 2018, QPL.
[14] Michele Mosca,et al. An algorithm for the T-count , 2013, Quantum Inf. Comput..
[15] Aleks Kissinger,et al. Reducing T-count with the ZX-calculus , 2019, 1903.10477.
[16] Simon Perdrix,et al. Rewriting Measurement-Based Quantum Computations with Generalised Flow , 2010, ICALP.
[17] 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.
[18] Quanlong Wang,et al. Techniques to Reduce $\pi/4$-Parity-Phase Circuits, Motivated by the ZX Calculus , 2019 .
[19] Simon Perdrix,et al. Pauli Fusion: a computational model to realise quantum transformations from ZX terms , 2019 .
[20] Bob Coecke,et al. Interacting quantum observables: categorical algebra and diagrammatics , 2009, ArXiv.
[21] Dominic Horsman,et al. The ZX calculus is a language for surface code lattice surgery , 2017, Quantum.
[22] Michele Mosca,et al. T-Count Optimization and Reed–Muller Codes , 2016, IEEE Transactions on Information Theory.
[23] 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).
[24] Aleks Kissinger,et al. Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning , 2017 .
[25] Renaud Vilmart,et al. A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics , 2018, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[26] Mark Howard,et al. Simulation of quantum circuits by low-rank stabilizer decompositions , 2018, Quantum.
[27] Cody Jones,et al. Low-overhead constructions for the fault-tolerant Toffoli gate , 2012, 1212.5069.
[28] Scott Aaronson,et al. Improved Simulation of Stabilizer Circuits , 2004, ArXiv.
[29] Daniel Litinski,et al. A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery , 2018, Quantum.
[30] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[31] Peter Selinger,et al. Proceedings of the 15th International Conference on Quantum Physics and Logic , 2019 .
[32] Fang Zhang,et al. Optimizing T gates in Clifford+T circuit as $\pi/4$ rotations around Paulis , 2019, 1903.12456.