Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
Quantum Information Processing
Erschienen in: Quantum Information Processing 10/2020

01.10.2020

A dynamic programming approach for distributing quantum circuits by bipartite graphs

verfasst von: Zohreh Davarzani, Mariam Zomorodi-Moghadam, Mahboobeh Houshmand, Mostafa Nouri-baygi

Erschienen in: Quantum Information Processing | Ausgabe 10/2020

Einloggen

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

search-config
loading …

Abstract

There are many challenges involved in building near-term large-scale quantum computers. Some of these challenges can be overcome by partitioning a quantum circuit into smaller parts and allowing each part to be executed on a smaller quantum unit. This approach is known as distributed quantum computation. In this study, a dynamic programming algorithm is proposed to minimize the number of communications in a distributed quantum circuit. This algorithm consists of two steps: first, the quantum circuit is converted into a bipartite graph model, and then a dynamic programming approach is proposed to partition the model into low-capacity quantum circuits. The proposed approach is evaluated on some benchmark quantum circuits, and a remarkable reduction in the number of required teleportations is obtained.
Vorheriger Artikel Ancilla-assisted frequency estimation under phase covariant noises with Greenberger–Horne–Zeilinger states
Nächster Artikel An online optimization algorithm for the real-time quantum state tomography

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Literatur
1.
Zomorodi-Moghadam, M., Houshmand, M., Houshmandi, M.: Optimizing teleportation cost in distributed quantum circuits. Theor. Phys. 57(3), 848–861 (2018)MathSciNetCrossRef
2.
Van Meter, R., Ladd, T.D., Fowler, A.G., Yamamoto, Y.: Distributed quantum computation architecture using semiconductor nanophotonics. Int. J. Quantum Inf. 8, 295–323 (2010)CrossRef
3.
Krojanski, H.G., Suter, D.: Scaling of decoherence in wide NMR quantum registers. Phys. Rev. Lett. 93(9), 090501 (2004)ADSCrossRef
4.
Nickerson, N.H., Li, Y., Benjamin, S.C.: Topological quantum computing with a very noisy network and local error rates approaching one percent. Nat. Commun. 4, 1756 (2013)ADSCrossRef
5.
Cuomo, D., Caleffi, M., Cacciapuoti, A.S.: Towards a distributed quantum computing ecosystem. arXiv preprint arXiv:​2002.​11808 (2020)
6.
Andres-Martinez, P.: Automated distribution of quantum circuits. Theoret. Comput. Sci. 410(26), 2489–2510 (2018)
7.
Van Meter, R., Oskin, M.: Architectural implications of quantum computing technologies. ACM J. Emerg. Technol. Comput. Syst. JETC 2, 2006 (2006)
8.
Meter, V., Munro, W., Nemoto, K., Itoh, K.M.: Arithmetic on a distributed-memory quantum multicomputer. ACM J. Emerg. Technol. Comput. Syst. JETC 3, 2 (2008)
9.
Bennett, C.H., Brassard, G., Crepeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels. Phys. Rev. Lett. 70, 1895 (1993)ADSMathSciNetCrossRef
10.
Whitney, M., Isailovic, N., Patel, Y., Kubiatowicz, J.: Automated generation of layout and control for quantum circuits. Phys. Rev. Lett. 85(26), 1330 (2000)
11.
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 10 anniversary edn. Cambridge University Press, Cambridge (2010)CrossRef
12.
Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299, 802–803 (1982)ADSCrossRef
13.
14.
Zomorodi-Moghadam, M., Taherkhani, M.-A., Navi, K.: Synthesis and optimization by quantum circuit description language. In: Transactions on Computational Science XXIV, pp. 74–91. Springer (2014)
15.
Deutsch, D.E.: Quantum computational networks. Proc. R. Soc. Lond. A Math. Phys. Sci. 425(1868), 73–90 (1989)ADSMathSciNetMATH
16.
17.
Zomorodi-Moghadam, M., Navi, K.: Rotation-based design and synthesis of quantum circuits. J. Circuits Syst. Comput. 25(12), 1650152 (2016)CrossRef
18.
Pham, P., Svore, K.M.: A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth. Quantum Inf. Comput. 13(11–12), 937–962 (2013)MathSciNet
19.
20.
Cleve, R., Buhrman, H.: Substituting quantum entanglement for communication. Phys. Rev. A 56, 1201 (1997)ADSCrossRef
21.
Cirac, J., Ekert, A., Huelga, S., Macchiavello, C.: Distributed quantum computation over noisy channels. Phys. Rev. A 59, 4249 (1999)ADSMathSciNetCrossRef
22.
Van Meter, R., Devitt, S.J.: The path to scalable distributed quantum computing. Computer 49(9), 31–42 (2016)CrossRef
23.
24.
25.
Ying, M., Feng, Y.: An algebraic language for distributed quantum computing. IEEE Trans. Comput. 58(6), 728–743 (2009)MathSciNetCrossRef
26.
Beals, R., Brierley, S., Gray, O., Harrow, A.W., Kutin, S., Linden, N., Shepherd, D., Stather, M.: Efficient distributed quantum computing. Proc. R. Soc. A Math. Phys. Eng. Sci. 469(2153), 20120686 (2013)ADSMathSciNetMATH
27.
Streltsov, A., Kampermann, H., Bruß, D.: Quantum cost for sending entanglement. Phys. Rev. Lett. 108, 250501 (2012)ADSCrossRef
28.
Caleffi, M., Cacciapuoti, A.S., Bianchi, G.: Quantum internet: from communication to distributed computing. In: Proceedings of the 5th ACM International Conference on Nanoscale Computing and Communication, pp. 1–4 (2018)
29.
Cacciapuoti, A.S., Caleffi, M., Tafuri, F., Cataliotti, F.S., Gherardini, S., Bianchi, G.: Quantum internet: networking challenges in distributed quantum computing. IEEE Netw. 34, 137–143 (2019)CrossRef
30.
Neumann, N.M.P., van Houte, R., Attema, T.: Imperfect distributed quantum phase estimation. In: International Conference on Computational Science, pp. 605–615. Springer (2020)
31.
32.
Buluç, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. In: Algorithm Engineering, pp. 117–158. Springer (2016)
33.
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291–307 (1970)CrossRef
34.
Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: 19th Design Automation Conference, pp. 175–181. IEEE (1982)
35.
Hendrickson, B., Leland, R.W.: A multi-level algorithm for partitioning graphs. SC 95(28), 1–14 (1995) MATH
36.
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1998)MathSciNetCrossRef
37.
Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. Very Large Scale Integr. VLSI Syst. 7(1), 69–79 (1999)CrossRef
38.
Zare, H., Shooshtari, P., Gupta, A., Brinkman, R.R.: Data reduction for spectral clustering to analyze high throughput flow cytometry data. BMC Bioinform. 11(1), 403 (2010)CrossRef
39.
Arias-Castro, E., Chen, G., Lerman, G., et al.: Spectral clustering based on local linear approximations. Electron. J. Stat. 5, 1537–1587 (2011)MathSciNetCrossRef
40.
Thulasiraman, K., Swamy, M.N.S.: Graphs: theory and algorithms. John Wiley & Sons (2011)
41.
Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. STOC’03 Proc. Thirty-Fifth Annu. ACM Symp. Theory Comput. 410(26), 59–68 (2003)MathSciNetCrossRef
42.
Whitfield, J.D., Biamonte, J., Aspuru-Guzik, A.: Simulation of electronic structure Hamiltonians using quantum computers. Mol. Phys. 109(5), 735–750 (2011)ADSCrossRef
43.
Wille, R., Grobe, D., Teuber, L., Dueck, G.W., Drechsler, R.: Revlib: an online resource for reversible functions and reversible circuits. In: IEEE International Symposium on Multiple-Valued Logic, pp. 220–225 (2008)
44.
Houshmand, M., et al.: An evolutionary approach to optimizing teleportation cost in distributed quantum computation. Int. J. Theor. Phys. 59(4), 1315–1329 (2020)MathSciNetCrossRef
Metadaten
Titel
A dynamic programming approach for distributing quantum circuits by bipartite graphs
verfasst von
Zohreh Davarzani
Mariam Zomorodi-Moghadam
Mahboobeh Houshmand
Mostafa Nouri-baygi
Publikationsdatum
01.10.2020
Verlag
Springer US
Erschienen in
Quantum Information Processing / Ausgabe 10/2020
Print ISSN: 1570-0755
Elektronische ISSN: 1573-1332
DOI
https://doi.org/10.1007/s11128-020-02871-7

Weitere Artikel der Ausgabe 10/2020

Quantum Information Processing 10/2020 Zur Ausgabe

OriginalPaper

Toward sampling from undirected probabilistic graphical models using a D-Wave quantum annealer

OriginalPaper

Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method

OriginalPaper

Enhancing nonlocal advantage of quantum coherence in correlated quantum channels

OriginalPaper

Elementary quantum gates between long-distance qubits mediated by a resonator

OriginalPaper

Optimizing the post-processing of online evolution reconstruction in quantum communication

OriginalPaper

Security analysis of measurement-device-independent quantum secure direct communication

Neuer Inhalt

    Bildnachweise