Category:Few-Qubits Fault Tolerant Quantum Computing Network Stage: Difference between revisions

From Quantum Protocol Zoo
Jump to navigation Jump to search
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
This stage di�ers by demanding that the local operations can be performed
The fifth network stage differs from the earlier ([[:Category:Quantum Memory Network Stage|Quantum Memory]]) stage by demanding that the local operations can be performed fault-tolerantly (without any error), which is considerably more challenging.The devices on the end nodes are not full fedged quantum computers but a smaller version of the same with fewer qubits than what is required to show quantum supremacy or efficiently do better than a classical computer. Fault tolerance implies that all error parameters of a quantum memory network can be made negligible by adding more resources. Here the number of qubits available is small enough such that the end nodes can be simulated effectively on a classical computer. Here, the main interest is the performance of the fault-
fault-tolerantly, which is considerably more challenging. The devices on the
tolerant scheme. However, this does not imply that the entire network can be simulated efficiently or that there would exist equivalent classical protocols; the effect of entanglement cannot generally be replicated classically.<br/>
network are full  
==Application==
edged quantum computers and able to carry out error cor-
Having access to fault-tolerant gates allows higher-accuracy clock synchronization (3) and protocols that require many rounds of communication and high circuit depth to be useful. This includes distributed quantum computing as well as applications for full-scale quantum computing networks, restricted to few qubits. This could be of great practical interest, especially for applica-
rection on data transfers.
tions in the domain of distributed systems.
Fault-tolerant operations being available would allow the execution of local
==Relevant Parameters==
quantum computation of high circuit depth as well as an arbitrary extension
*Number of logical qubits q
of storage times to execute protocols with an arbitrary number of rounds of
communication. Fault tolerance implies that all error parameters of a quantum
memory network can be made negligible by adding more resources.
The term few qubits here refers to the fact that the number of qubits avail-
able is small enough so that the end nodes can be simulated e�ectively on a
classical computer. Here, the main interest is the performance of the fault-
tolerant scheme, This does not imply that the entire network can be simulated
e�ciently or that there would exist equivalent classical protocols; the e�ects
of entanglement cannot generally be replicated classically.
Applications:
Having access to fault-tolerant gates allows higher-accuracy clock synchro-
nization (3) and protocols that require many rounds of communication and
high circuit depth to be useful. This includes distributed quantum computing
as well as applications for full-scale quantum computing networks, restricted
to few qubits. This could be of great practical interest, especially for applica-
tions in the domain of distributed systems, but as with the implementation of
quantum algorithms on quantum computers, the power of having only a lim-
ited number of qubits at our disposal is an important subject of investigation


[[Category:Network Stages]]
[[Category:Network Stages]]

Latest revision as of 04:12, 11 July 2019

The fifth network stage differs from the earlier (Quantum Memory) stage by demanding that the local operations can be performed fault-tolerantly (without any error), which is considerably more challenging.The devices on the end nodes are not full fedged quantum computers but a smaller version of the same with fewer qubits than what is required to show quantum supremacy or efficiently do better than a classical computer. Fault tolerance implies that all error parameters of a quantum memory network can be made negligible by adding more resources. Here the number of qubits available is small enough such that the end nodes can be simulated effectively on a classical computer. Here, the main interest is the performance of the fault- tolerant scheme. However, this does not imply that the entire network can be simulated efficiently or that there would exist equivalent classical protocols; the effect of entanglement cannot generally be replicated classically.

Application[edit]

Having access to fault-tolerant gates allows higher-accuracy clock synchronization (3) and protocols that require many rounds of communication and high circuit depth to be useful. This includes distributed quantum computing as well as applications for full-scale quantum computing networks, restricted to few qubits. This could be of great practical interest, especially for applica- tions in the domain of distributed systems.

Relevant Parameters[edit]

  • Number of logical qubits q

This category currently contains no pages or media.

Retrieved from "https://wiki.veriqloud.fr/index.php?title=Category:Few-Qubits_Fault_Tolerant_Quantum_Computing_Network_Stage&oldid=3509"