Skip to main content
Erschienen in: Quantum Information Processing 3/2015

01.03.2015

Reducing the number of ancilla qubits and the gate count required for creating large controlled operations

verfasst von: Katherine L. Brown, Anmer Daskin, Sabre Kais, Jonathan P. Dowling

Erschienen in: Quantum Information Processing | Ausgabe 3/2015

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we show that it is possible to adapt a qudit scheme for creating a controlled-Toffoli created by Ralph et al. (Phys Rev A 75:022313, 2007) to be applicable to qubits. While this scheme requires more gates than standard schemes for creating large controlled gates, we show that with simple adaptations, it is directly equivalent to the standard scheme in the literature. This scheme is the most gate-efficient way of creating large controlled unitaries currently known; however, it is expensive in terms of the number of ancilla qubits used. We go on to show that using a combination of these standard techniques presented by Barenco et al. (Phys Rev A 52(5):3457, 1995), we can create an n-qubit version of the Toffoli using less gates and the same number of ancilla qubits as recent work using computer optimization. This would be useful in any architecture of quantum computing where gates are cheap but qubit initialization is expensive.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484 (1997)CrossRefMATHMathSciNet Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484 (1997)CrossRefMATHMathSciNet
2.
Zurück zum Zitat Daskin, A., Kais, S.: Decomposition of unitary matrices for finding quantum circuits: application to molecular Hamiltonians. J. Chem. Phys. 134(14), 144112 (2011). doi:10.1063/1.3575402 CrossRefADS Daskin, A., Kais, S.: Decomposition of unitary matrices for finding quantum circuits: application to molecular Hamiltonians. J. Chem. Phys. 134(14), 144112 (2011). doi:10.​1063/​1.​3575402 CrossRefADS
3.
Zurück zum Zitat Wang, H., Kais, S., Äsp\(\check{\rm {u}}\)rû Gŭzík, A., Hoffmann, M.R.: Quantum algorithm for obtaining the energy spectrum of molecular systems. Phys. Chem. Chem. Phys. 10(35), 5388 (2008). doi:10.1039/b804804e Wang, H., Kais, S., Äsp\(\check{\rm {u}}\)rû Gŭzík, A., Hoffmann, M.R.: Quantum algorithm for obtaining the energy spectrum of molecular systems. Phys. Chem. Chem. Phys. 10(35), 5388 (2008). doi:10.​1039/​b804804e
4.
Zurück zum Zitat Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (ACM, New York, NY, USA, 2003), STOC ’03, pp. 59–68 (2003). doi:10.1145/780542.780552 Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (ACM, New York, NY, USA, 2003), STOC ’03, pp. 59–68 (2003). doi:10.​1145/​780542.​780552
5.
Zurück zum Zitat Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Complete methods set for scalable ion trap quantum information processing. Phys. Rev. A 52(5), 3457 (1995). doi:10.1103/PhysRevA.52.3457 CrossRefADS Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Complete methods set for scalable ion trap quantum information processing. Phys. Rev. A 52(5), 3457 (1995). doi:10.​1103/​PhysRevA.​52.​3457 CrossRefADS
6.
Zurück zum Zitat Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)MATH Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)MATH
8.
Zurück zum Zitat Maslov, D., Young, C., Miller, D., Dueck, G.: Quantum circuit simplification using templates. In: Design, Automation and Test in Europe, 2005. Proceedings, vol. 2, pp. 1208–1213 (2005). doi:10.1109/DATE.2005.249 Maslov, D., Young, C., Miller, D., Dueck, G.: Quantum circuit simplification using templates. In: Design, Automation and Test in Europe, 2005. Proceedings, vol. 2, pp. 1208–1213 (2005). doi:10.​1109/​DATE.​2005.​249
9.
Zurück zum Zitat Scott, N.O., Dueck, G.W.: Pairwise decomposition of toffoli gates in a quantum circuit. In: Proceedings of the 18th ACM Great Lakes symposium on VLSI (ACM, New York, NY, USA, 2008), GLSVLSI ’08, pp. 231–236 (2008). doi:10.1145/1366110.1366168 Scott, N.O., Dueck, G.W.: Pairwise decomposition of toffoli gates in a quantum circuit. In: Proceedings of the 18th ACM Great Lakes symposium on VLSI (ACM, New York, NY, USA, 2008), GLSVLSI ’08, pp. 231–236 (2008). doi:10.​1145/​1366110.​1366168
10.
Zurück zum Zitat Wille, R., Grosse, D., Teuber, L., Dueck, G., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: Multiple Valued Logic, 2008. ISMVL 2008. 38th International Symposium on, pp. 220–225 (2008). doi:10.1109/ISMVL.2008.43 Wille, R., Grosse, D., Teuber, L., Dueck, G., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: Multiple Valued Logic, 2008. ISMVL 2008. 38th International Symposium on, pp. 220–225 (2008). doi:10.​1109/​ISMVL.​2008.​43
11.
Zurück zum Zitat Miller, D.M.: Lower cost quantum gate realizations of multiple-control Toffoli gates. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, 2009. 308–313 (2009). doi:10.1109/PACRIM.2009.5291355 Miller, D.M.: Lower cost quantum gate realizations of multiple-control Toffoli gates. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, 2009. 308–313 (2009). doi:10.​1109/​PACRIM.​2009.​5291355
12.
Zurück zum Zitat Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffoli gates. In: 41st IEEE International Symposium on Multipe-Valued Logic, pp. 288–293 (2011). doi:10.1109/ISMVL.2011.54 Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffoli gates. In: 41st IEEE International Symposium on Multipe-Valued Logic, pp. 288–293 (2011). doi:10.​1109/​ISMVL.​2011.​54
14.
Zurück zum Zitat Lanyon, B.P., Barbieri, M., Almeida, M.P., Jennewein, T., Ralph, T.C., Resch, K.J., Pryde, G.J., O’Brien, J.L., Gilchrist, A., White, A.G.: Simplifying quantum logic using higher-dimensional Hilbert spaces. Nat. Phys. 5(2), 134 (2008). doi:10.1038/nphys1150 CrossRef Lanyon, B.P., Barbieri, M., Almeida, M.P., Jennewein, T., Ralph, T.C., Resch, K.J., Pryde, G.J., O’Brien, J.L., Gilchrist, A., White, A.G.: Simplifying quantum logic using higher-dimensional Hilbert spaces. Nat. Phys. 5(2), 134 (2008). doi:10.​1038/​nphys1150 CrossRef
16.
Zurück zum Zitat Margolus, N.: Simple quantum gates. unpublished manuscript c. (1994) Margolus, N.: Simple quantum gates. unpublished manuscript c. (1994)
17.
Zurück zum Zitat DiVincenzo, D.P.: Quantum gates and circuits. In: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454(1969), 261 (1998). doi:10.1098/rspa.1998.0159 DiVincenzo, D.P.: Quantum gates and circuits. In: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454(1969), 261 (1998). doi:10.​1098/​rspa.​1998.​0159
Metadaten
Titel
Reducing the number of ancilla qubits and the gate count required for creating large controlled operations
verfasst von
Katherine L. Brown
Anmer Daskin
Sabre Kais
Jonathan P. Dowling
Publikationsdatum
01.03.2015
Verlag
Springer US
Erschienen in
Quantum Information Processing / Ausgabe 3/2015
Print ISSN: 1570-0755
Elektronische ISSN: 1573-1332
DOI
https://doi.org/10.1007/s11128-014-0900-1

Weitere Artikel der Ausgabe 3/2015

Quantum Information Processing 3/2015 Zur Ausgabe

Neuer Inhalt