Editing
Category:Few-Qubits Fault Tolerant Quantum Computing Network Stage
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
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- 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/> ==Application== 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== *Number of logical qubits q [[Category:Network Stages]]
Summary:
Please note that all contributions to Quantum Protocol Zoo may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Quantum Protocol Zoo:Copyrights
for details).
Do not submit copyrighted work without permission!
To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Log in
Namespaces
Category
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
News
Protocol Library
Certification Library
Nodal Subroutines
Codes Repository
Knowledge Graphs
Submissions
Categories
Supplementary Information
Recent Changes
Contact us
Help
Tools
What links here
Related changes
Special pages
Page information