About: In the near-term, the number of qubits in quantum computers will be limited to a few hundreds. Therefore, problems are often too large and complex to be run on quantum devices. By distributing quantum algorithms over different devices, larger problem instances can be run. This distributing however, often requires operations between two qubits of different devices. Using shared entangled states and classical communication, these operations between different devices can still be performed. In the ideal case of perfect fidelity, distributed quantum computing is a solution to achieving scalable quantum computers with a larger number of qubits. In this work we consider the effects on the output fidelity of a quantum algorithm when using noisy shared entangled states. We consider the quantum phase estimation algorithm and present two distribution schemes for the algorithm. We give the resource requirements for both and show that using less noisy shared entangled states results in a higher overall fidelity.   Goto Sponge  NotDistinct  Permalink

An Entity of Type : fabio:Abstract, within Data Space : wasabi.inria.fr associated with source document(s)

AttributesValues
type
value
  • In the near-term, the number of qubits in quantum computers will be limited to a few hundreds. Therefore, problems are often too large and complex to be run on quantum devices. By distributing quantum algorithms over different devices, larger problem instances can be run. This distributing however, often requires operations between two qubits of different devices. Using shared entangled states and classical communication, these operations between different devices can still be performed. In the ideal case of perfect fidelity, distributed quantum computing is a solution to achieving scalable quantum computers with a larger number of qubits. In this work we consider the effects on the output fidelity of a quantum algorithm when using noisy shared entangled states. We consider the quantum phase estimation algorithm and present two distribution schemes for the algorithm. We give the resource requirements for both and show that using less noisy shared entangled states results in a higher overall fidelity.
subject
  • Emerging technologies
  • Information theory
  • Theoretical computer science
  • Australian inventions
  • Quantum information science
  • Quantum computing
  • Quantum algorithms
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software