منابع مشابه
A surface code quantum computer in silicon
The exceptionally long quantum coherence times of phosphorus donor nuclear spin qubits in silicon, coupled with the proven scalability of silicon-based nano-electronics, make them attractive candidates for large-scale quantum computing. However, the high threshold of topological quantum error correction can only be captured in a two-dimensional array of qubits operating synchronously and in par...
متن کاملAll-silicon quantum computer.
A solid-state implementation of a quantum computer composed entirely of silicon is proposed. Qubits are 29Si nuclear spins arranged as chains in a 28Si (spin-0) matrix with Larmor frequencies separated by a large magnetic field gradient. No impurity dopants or electrical contacts are needed. Initialization is accomplished by optical pumping, algorithmic cooling, and pseudo-pure state techniques...
متن کاملSurface code quantum communication.
Quantum communication typically involves a linear chain of repeater stations, each capable of reliable local quantum computation and connected to their nearest neighbors by unreliable communication links. The communication rate of existing protocols is low as two-way classical communication is used. By using a surface code across the repeater chain and generating Bell pairs between neighboring ...
متن کاملSimulating the transverse Ising model on a quantum computer: Error correction with the surface code
We estimate the resource requirements for the quantum simulation of the ground-state energy of the onedimensional quantum transverse Ising model based on the surface code implementation of a fault-tolerant quantum computer. The surface code approach has one of the highest known tolerable error rates (∼1%) which makes it currently one of the most practical quantum computing schemes. Compared to ...
متن کاملToward a Silicon - Based Nuclear - Spin Quantum Computer
quantum computing is to identify a system that can be scaled up to the number of qubits needed to execute nontrivial quantum algorithms. Peter Shor’s algorithm for finding the prime factors of numbers used in public-encryption systems (numbers that typically consist of more than a hundred digits) would likely require a quantum computer with several thousand qubits. Depending on the error correc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science Advances
سال: 2015
ISSN: 2375-2548
DOI: 10.1126/sciadv.1500707