Completeness of the ZX-Calculus
暂无分享,去创建一个
[1] Dominic Horsman,et al. Quantum picturalism for topological cluster-state computing , 2011, 1101.4722.
[2] Ross Duncan,et al. Interacting Frobenius Algebras are Hopf , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[3] Miriam Backens,et al. The ZX-calculus is complete for stabilizer quantum mechanics , 2013, 1307.7025.
[4] Quanlong Wang,et al. Two complete axiomatisations of pure-state qubit quantum computing , 2018, LICS.
[5] Miriam Backens,et al. A Complete Graphical Calculus for Spekkens’ Toy Bit Theory , 2014, 1411.1618.
[6] Simon Perdrix,et al. A Simplified Stabilizer ZX-calculus , 2016, QPL.
[7] H. Briegel,et al. Measurement-based quantum computation on cluster states , 2003, quant-ph/0301052.
[8] Peter Selinger,et al. Exact synthesis of multi-qubit Clifford+T circuits , 2012, ArXiv.
[9] P. Selinger. A Survey of Graphical Languages for Monoidal Categories , 2009, 0908.3347.
[10] Daniel Gottesman. Quantum Error Correction and Fault-Tolerance , 2005 .
[11] Simon Perdrix,et al. Pivoting makes the ZX-calculus complete for real stabilizers , 2013, QPL.
[12] S. Aaronson,et al. Improved simulation of stabilizer circuits (14 pages) , 2004 .
[13] Miriam Backens,et al. The ZX-calculus is complete for the single-qubit Clifford+T group , 2014, QPL.
[14] Amar Hadzihasanovic,et al. A Diagrammatic Axiomatisation for Qubit Entanglement , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.
[15] Amar Hadzihasanovic,et al. The algebra of entanglement and the geometry of composition , 2017, ArXiv.
[16] Ross Duncan,et al. Verifying the Steane code with Quantomatic , 2013, QPL.
[17] Yaoyun Shi. Both Toffoli and controlled-NOT need little help to do universal quantum computing , 2003, Quantum Inf. Comput..
[18] Aleks Kissinger,et al. Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning , 2017 .
[19] Ross Duncan,et al. Verifying the Smallest Interesting Colour Code with Quantomatic , 2017, QPL.
[20] Simon Perdrix,et al. Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics , 2018, LICS.
[21] Ross Duncan,et al. A graphical approach to measurement-based quantum computing , 2012, Quantum Physics and Linguistics.
[22] Aleks Kissinger,et al. Quantomatic: A proof assistant for diagrammatic reasoning , 2015, CADE.
[23] Quanlong Wang,et al. ZX-Rules for 2-Qubit Clifford+T Quantum Circuits , 2018, RC.
[24] Renaud Vilmart,et al. A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond , 2018, QPL.
[25] Stefan Zohren,et al. Graphical structures for design and verification of quantum error correction , 2016, Quantum Science and Technology.
[26] Aleks Kissinger,et al. The Compositional Structure of Multipartite Quantum Entanglement , 2010, ICALP.
[27] Vladimir Zamdzhiev,et al. The ZX calculus is incomplete for quantum mechanics , 2014, QPL.
[28] Simon Perdrix,et al. Rewriting Measurement-Based Quantum Computations with Generalised Flow , 2010, ICALP.
[29] Simon Perdrix,et al. ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics , 2017, MFCS.
[30] Bob Coecke,et al. Interacting quantum observables: categorical algebra and diagrammatics , 2009, ArXiv.
[31] Simon Perdrix,et al. Towards a Minimal Stabilizer ZX-calculus , 2017, Log. Methods Comput. Sci..
[32] Quanlong Wang,et al. A universal completion of the ZX-calculus , 2017, ArXiv.
[33] Simon Perdrix,et al. Supplementarity is Necessary for Quantum Diagram Reasoning , 2015, MFCS.
[34] Simon Perdrix,et al. A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics , 2017, LICS.
[35] Dominic Horsman,et al. The ZX calculus is a language for surface code lattice surgery , 2017, Quantum.