Abstract
The work proposes an extension of the quantum circuit formalism where qubits (wires) are circular instead of linear. The left-to-right interpretation of a quantum circuit is replaced by a circular representation which allows to select the starting point and the direction in which gates are executed. The representation supports all the circuits obtained after computing cyclic permutations of an initial quantum gate list. Two circuits, where one has a gate list which is a cyclic permutation of the other, will implement different functions. The main question appears in the context of scalable quantum computing, where multiple subcircuits are used for the construction of a larger fault-tolerant one: can the same circular representation be used by multiple subcircuits? The circular circuits defined and analysed in this work consist only of CNOT gates. These are sufficient for constructing computationally universal, fault-tolerant circuits formed entirely of qubit initialisation, CNOT gates and qubit measurements. The main result of modelling circular CNOT circuits is that a derived Boolean representation allows to define a set of equations for X and Z stabiliser transformations. Through a well defined set of steps it is possible to reduce the initial equations to a set of stabiliser transformations given a series of cuts through the circular circuit.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aaronson, S., Gottesman, D.: Improved simulation of stabilizer circuits. Phys. Rev. A 70(5), 052328 (2004)
Bravyi, S., Kitaev, A.: Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71(2), 022316 (2005)
Fowler, A.G., Mariantoni, M., Martinis, J.M., Cleland, A.N.: Surface codes, towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012)
Fowler, A.G.: Time-optimal quantum computation (2012). arXiv arXiv:1210.4626
Maslov, D., Dueck, G.W., Michael Miller, D.: Simplification of Toffoli networks via templates. In: Proceedings 16th Symposium on Integrated Circuits and Systems Design, SBCCI 2003, pp. 53–58. IEEE (2003)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)
Paler, A., Polian, I., Nemoto, K., Devitt, S.J.: A fully fault-tolerant representation of quantum circuits. In: Krivine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 139–154. Springer, Heidelberg (2015)
Patel, K.N., Hayes, J.P., Markov, I.L.: Fault testing for reversible circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(8), 1220–1230 (2004)
Polian, I., Fiehn, T., Becker, B., Hayes, J.P.: A family of logical fault models for reversible circuits. In: Proceedings of the 14th Asian Test Symposium 2005, pp. 422–427. IEEE (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Paler, A. (2016). Circular CNOT Circuits: Definition, Analysis and Application to Fault-Tolerant Quantum Circuits. In: Devitt, S., Lanese, I. (eds) Reversible Computation. RC 2016. Lecture Notes in Computer Science(), vol 9720. Springer, Cham. https://doi.org/10.1007/978-3-319-40578-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-40578-0_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40577-3
Online ISBN: 978-3-319-40578-0
eBook Packages: Computer ScienceComputer Science (R0)