Entanglement-efficient bipartite-distributed quantum computing
Open Access
- 5 December 2023
- journal article
- research article
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1196
Abstract
In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by entanglement-assisted local operations and classical communication. To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol. To this end, we extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] implementing each nonlocal controlled-unitary gate locally with one maximally entangled pair to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally using one maximally entangled pair. In particular, two types of packing processes are introduced as the building blocks, namely the distributing processes and embedding processes. Each distributing process distributes corresponding gates locally with one entangled pair. The efficiency of entanglement is then enhanced by embedding processes, which merge two non-sequential distributing processes and hence save the entanglement cost. We show that the structure of distributability and embeddability of a quantum circuit can be fully represented by the corresponding packing graphs and conflict graphs. Based on these graphs, we derive heuristic algorithms for finding an entanglement-efficient packing of distributing processes for a given quantum circuit to be implemented by two parties. These algorithms can determine the required number of local auxiliary qubits in the DQC. We apply these algorithms for bipartite DQC of unitary coupled-cluster circuits and find a significant reduction of entanglement cost through embeddings. This method can determine a constructive upper bound on the entanglement cost for the DQC of quantum circuits.Keywords
All Related Versions
Funding Information
- NSTC (110-2112-M-032-005-MY3)
- NSTC (111-2923-M-032- 002-MY5)
- NSTC (111-2119-M-008-002)
- NSTC (112-2112-M-032- 008-MY3)
- MEXT (JPMXS0118069605)
- MEXT (JPMXS0120351339)
- JSPS (18K13467)
- JSPS (21H03394)
This publication has 55 references indexed in Scilit:
- Heralded Entanglement Between Widely Separated AtomsScience, 2012
- An elementary quantum network of single atoms in optical cavitiesNature, 2012
- Arithmetic on a distributed-memory quantum multicomputerACM Journal on Emerging Technologies in Computing Systems, 2008
- Distributed quantum computation based on small quantum registersPhysical Review A, 2007
- Probabilistic quantum gates between remote atoms through interference of optical frequency qubitsPhysical Review A, 2006
- New perspectives on unitary coupled‐cluster theoryInternational Journal of Quantum Chemistry, 2006
- Remote control of restricted sets of operations: Teleportation of anglesPhysical Review A, 2002
- Methodology for quantum logic gate constructionPhysical Review A, 2000
- Entanglement-Assisted Local Manipulation of Pure Quantum StatesPhysical Review Letters, 1999
- On cliques in graphsIsrael Journal of Mathematics, 1965