Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Quantum-Logic Synthesis of Hermitian Gates

Published: 28 December 2015 Publication History

Abstract

In this article, the problem of synthesizing a general Hermitian quantum gate into a set of primary quantum gates is addressed. To this end, an extended version of the Jacobi approach for calculating the eigenvalues of Hermitian matrices in linear algebra is considered as the basis of the proposed synthesis method. The quantum circuit synthesis method derived from the Jacobi approach and its optimization challenges are described. It is shown that the proposed method results in multiple-control rotation gates around the y axis, multiple-control phase shift gates, multiple-control NOT gates, and a middle diagonal Hermitian matrix, which can be synthesized to multiple-control Pauli Z gates. Using the proposed approach, it is shown how multiple-control U gates, where U is a single-qubit Hermitian quantum gate, can be implemented using a linear number of elementary gates in terms of circuit lines with the aid of one auxiliary qubit in an arbitrary state.

References

[1]
M. Arabzadeh, M. Saeedi, and M. Saheb Zamani. 2010. Rule-based optimization of reversible circuits. In Asia and South Pacific Design Automation Conference. 849--854.
[2]
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter. 1995. Elementary gates for quantum computation. Physical Review A 52 (1995), 3457--3467.
[3]
V. Bergholm, J. J. Vartiainen, M. Möttönen, and M. M. Salomaa. 2005. Quantum circuits with uniformly controlled one-qubit gates. Physical Review A 71 (2005), 052330.
[4]
A. Broadbent and E. Kashefi. 2009. Parallelizing quantum circuits. Theoretical Computer Science 410, 26 (June 2009), 2489--2510.
[5]
S. S. Bullock and I. L. Markov. 2004. Asymptotically optimal circuits for arbitrary n-qubit diagonal computations. Quantum Information and Computation 4, 1 (2004), 27--47.
[6]
G. Cybenko. 2001. Reducing quantum computations to elementary unitary operations. Computing in Science and Engineering 3, 2 (2001), 27--32.
[7]
V. Danos, E. Kashefi, P. Panangaden, and S. Perdrix. 2009. Extended Measurement Calculus. Semantic Techniques in Quantum Computation.
[8]
R. Feynman. 1982. Simulating physics with computers. International Journal of Theoretical Physics 21 (1982), 467--488.
[9]
G. H. Golub and C. F. Van Loan. 1996. Matrix Computations. Vol. 3. JHUP.
[10]
M. Grassl. 2008. Circuits for quantum error-correction codes. http://iaks-www.ira.uka.de/home/grassl/QECC/circuits/.
[11]
L. K. Grover. 1996. A fast quantum mechanical algorithm for database search. ACM Symposium on Theory of Computing (1996).
[12]
A. W. Harrow, A. Hassidim, and S. Lloyd. 2009. Quantum algorithm for linear systems of equations. Physical Review Letters 103, 15 (2009), 150502.
[13]
M. Houshmand, M. Saheb Zamani, M. Sedighi, and M. Arabzadeh. 2014. Decomposition of diagonal hermitian quantum gates using multiple-controlled pauli z gates. To Appear in ACM Journal of Emerging Technologies and Computer Systemes E-Print, Quant-Ph/1405.6741 (2014).
[14]
Chia-Chun Lin, Amlan Chakrabarti, and Niraj K. Jha. 2014. FTQLS: Fault-tolerant quantum logic synthesis. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 22, 6 (2014), 1350--1363.
[15]
D. Maslov, G. W. Dueck, D. M. Miller, and C. Negrevergne. 2008. Quantum circuit simplification and level compaction. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27, 3 (2008), 436--444.
[16]
M. A. Nielsen and I. L. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press.
[17]
H. Park and V. Hari. 1993. A real algorithm for the Hermitian eigenvalue decomposition. BIT Numerical Mathematics 33, 1 (1993), 158--171.
[18]
A. Pathak. 2013. Non-Hermitian quantum gates are more common than Hermitian quantum gates. E-Print, Quant-Ph/1309.4037v1 (2013).
[19]
M. Saeedi, M. Arabzadeh, M. Saheb Zamani, and M. Sedighi. 2011. Block-based quantum-logic synthesis. Quantum Information and Computation 11, 3--4 (2011), 262--277.
[20]
V. V. Shende, S. S. Bullock, and I. L. Markov. 2006. Synthesis of quantum-logic circuits. IEEE Transactions on CAD 25, 6 (June 2006), 1000--1010.
[21]
V. V. Shende and I. L. Markov. 2009. On the CNOT-cost of Toffoli gates. Quantum Information and Computation 9, 5--6 (May 2009), 461--486.
[22]
V. V. Shende, I. L. Markov, and S. S. Bullock. 2004. Smaller two-qubit circuits for quantum communication and computation. Design, Automation and Test in Europe (2004), 980--985.
[23]
P. W. Shor. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26 (1997), 1484--1509.
[24]
J. J. Vartiainen, M. Möttönen, and M. M. Salomaa. 2004. Efficient decomposition of quantum gates. Physical Review Letters 92 (2004), 177902.
[25]
F. Vatan and C. Williams. 2004a. Optimal quantum circuits for general two-qubit gates. Physical Review A 69 (2004), 032315.
[26]
F. Vatan and C. P. Williams. 2004b. Realization of a general three-qubit quantum gate. E-Print, Quant-Ph/0401178 (2004).
[27]
G. Vidal and C. M. Dawson. 2004. A universal quantum circuit for two-qubit transformations with three CNOT gates. Physical Review A 69 (2004), 010301.
[28]
N. Wiebe, D. Braun, and S. Lloyd. 2012. Quantum algorithm for data fitting. Physical Review Letters 109, 5 (2012), 050505.
[29]
C. Wu, Y. Tsai, and H. Tsai. 2005. Quantum circuits for stabilizer codes. In IEEE International Symposium on Circuits and Systems, (ISCAS’05). 2333--2336.

Cited By

View all
  • (2017)Quantum Circuit Synthesis Targeting to Improve One-Way Quantum Computation Pattern Cost MetricsACM Journal on Emerging Technologies in Computing Systems10.1145/306483413:4(1-27)Online publication date: 21-May-2017

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Journal on Emerging Technologies in Computing Systems
ACM Journal on Emerging Technologies in Computing Systems  Volume 12, Issue 4
Regular Papers
July 2016
394 pages
ISSN:1550-4832
EISSN:1550-4840
DOI:10.1145/2856147
  • Editor:
  • Yuan Xie
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

Publication History

Published: 28 December 2015
Accepted: 01 June 2015
Revised: 01 March 2015
Received: 01 September 2014
Published in JETC Volume 12, Issue 4

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Hermitian gates
  2. Quantum computation
  3. synthesis

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

  • National Science Foundation

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2017)Quantum Circuit Synthesis Targeting to Improve One-Way Quantum Computation Pattern Cost MetricsACM Journal on Emerging Technologies in Computing Systems10.1145/306483413:4(1-27)Online publication date: 21-May-2017

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media