Write a Blog >>
Sun 19 Jan 2020 17:30 - 17:50 at Maurepas - Quantum-Classical Communication Chair(s): Michael Hicks

Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits over multiple agents, minimising quantum communication between them. We reduce the problem to hypergraph partitioning and then solve it with state-of-the-art optimisers. This makes our approach useful in practice, unlike previous methods. Our implementation is evaluated on five quantum circuits of practical relevance.

Sun 19 Jan
Times are displayed in time zone: (GMT-06:00) Saskatchewan, Central America change

16:50 - 17:50: PLanQC - Quantum-Classical Communication at Maurepas
Chair(s): Michael HicksUniversity of Maryland
planqc-2020-papers16:50 - 17:10
Alexander McCaskeyOak Ridge National Laboratory, Tiffany MintzOak Ridge National Laboratory, Eugene DumitrescuOak Ridge National Laboratory, Sarah PowersOak Ridge National Laboratory, Shirley MooreOak Ridge National Laboratory, Pavel LougovskiOak Ridge National Laboratory
planqc-2020-papers17:10 - 17:30
Dongho LEELRI / CEA LIST, Univ Paris Saclay, Sebastien BardinCEA LIST, Valentin PerrelleCEA, LIST, France, Benoit ValironLRI, CentraleSupelec, Univ. Paris Saclay
File Attached
planqc-2020-papers17:30 - 17:50
Pablo Andres-MartinezUniversity of Edinburgh, Chris HeunenUniversity of Edinburgh
Link to publication DOI Pre-print Media Attached File Attached