The paper introduces fusion-based quantum computing (FBQC), a model of universal quantum computation in which entangling measurements called fusions are performed on the qubits of small constant-sized entangled resource states. The authors propose a stabilizer formalism for analyzing fault tolerance and computation in these schemes. One of the key advantages of FBQC is that it offers significant architectural simplifications; it enables hardware made up of many identical modules and requires an extremely low depth of operations on each physical qubit, thereby reducing classical processing requirements. The paper presents two pedagogical examples of fault-tolerant schemes constructed within the FBQC framework. The authors numerically evaluate the threshold of these schemes under a hardware-agnostic fusion error model, which includes both erasure and Pauli errors. They also study an error model specific to linear optical quantum computing, considering probabilistic fusion and photon loss. In FBQC, the non-determinism of fusion is directly addressed by the quantum error correction protocol along with other errors. The authors find that tailoring the fault-tolerance framework to the physical system allows for a higher threshold compared to schemes reported in existing literature. The paper concludes by presenting a ballistic scheme that can tolerate a 10.4% probability of suffering photon loss in each fusion; this demonstrates the robustness and potential practicality of FBQC in real-world implementations. Overall, this research contributes to advancing understanding and development of fusion-based quantum computing as a promising approach for achieving fault-tolerant universal quantum computation with simplified architecture and reduced classical processing requirements.
Fusion-based quantum computing (FBQC) is a new way of doing computer calculations. It uses special measurements called fusions on small groups of connected qubits, which are the building blocks of a quantum computer. The stabilizer formalism is a method for studying how well FBQC works and how it can handle mistakes. FBQC has many advantages, like making the computer simpler and using the same parts over and over again. There are also examples of how FBQC can fix mistakes and work even when some parts stop working. Scientists have tested FBQC to see how well it works in different situations, like when there are errors or things go wrong. They found that FBQC can still work well even with some problems happening. This shows that FBQC could be useful in real-life situations."
Definitions
- Fusion-based quantum computing (FBQC): A new way of doing computer calculations using special measurements called fusions on small groups of connected qubits.
- Qubits: The building blocks of a quantum computer.
- Stabilizer formalism: A method for studying how well FBQC works and how it can handle mistakes.
- Architectural simplifications: Making the computer simpler by using identical modules.
- Threshold: The point at which something starts to work or stops working properly.
Fusion-Based Quantum Computing: A Promising Approach for Fault-Tolerant Universal Quantum Computation
Quantum computing is a rapidly advancing field of research, with the potential to revolutionize many aspects of our lives. One promising approach to quantum computing is fusion-based quantum computing (FBQC), which offers significant architectural simplifications and requires an extremely low depth of operations on each physical qubit. We will also explore how tailoring the fault-tolerance framework to the physical system allows for a higher threshold compared to schemes reported in existing literature.
What is Fusion-Based Quantum Computing?
FBQC is a model of universal quantum computation in which entangling measurements called fusions are performed on the qubits of small constant-sized entangled resource states. The authors propose a stabilizer formalism for analyzing fault tolerance and computation in these schemes. One key advantage of FBQC is that it enables hardware made up of many identical modules and requires an extremely low depth of operations on each physical qubit, thereby reducing classical processing requirements.
Two Pedagogical Examples
The paper presents two pedagogical examples of fault-tolerant schemes constructed within the FBQC framework. The authors numerically evaluate the threshold under a hardware agnostic fusion error model, which includes both erasure and Pauli errors, as well as an error model specific to linear optical quantum computing considering probabilistic fusion and photon loss. In FBQC, non determinism from fusion is directly addressed by its own error correction protocol along with other errors present in any implementation; this makes it possible to achieve high thresholds even when using imperfect components or noisy channels between them.
Tailoring Fault Tolerance Framework
The authors find that tailoring the fault tolerance framework to the physical system allows for a higher threshold compared to schemes reported in existing literature; they demonstrate this through their ballistic scheme that can tolerate 10% probability per fusion suffering photon loss without compromising accuracy or speedup over classical methods - demonstrating robustness and potential practicality for real world implementations..
Conclusion
Overall, this research contributes significantly towards advancing understanding and development of fusion based quantum computing as a promising approach for achieving fault tolerant universal quantum computation with simplified architecture and reduced classical processing requirements - making it more accessible than ever before!
We introduce fusion-based quantum computing (FBQC) - a model of universal quantum computation in which entangling measurements, called fusions, are performed on the qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics. FBQC can offer significant architectural simplifications, enabling hardware made up of many identical modules, requiring an extremely low depth of operations on each physical qubit and reducing classical processing requirements. We present two pedagogical examples of fault-tolerant schemes constructed in this framework and numerically evaluate their threshold under a hardware agnostic fusion error model including both erasure and Pauli error. We also study an error model of linear optical quantum computing with probabilistic fusion and photon loss. In FBQC the non-determinism of fusion is directly dealt with by the quantum error correction protocol, along with other errors. We find that tailoring the fault-tolerance framework to the physical system allows the scheme to have a higher threshold than schemes reported in literature. We present a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion.
