Scalable trapped ion quantum computation with a probabilistic ion-photon mapping

2004 ◽  
Vol 4 (3) ◽  
pp. 165-173
Author(s):  
L.-M. Duan ◽  
B.B. Blinov ◽  
D.L. Moehring ◽  
C. Monroe

We propose a method for scaling trapped ions for large-scale quantum computation and communication based on a probabilistic ion-photon mapping. Deterministic quantum gates between remotely located trapped ions can be achieved through detection of spontaneously-emitted photons, accompanied by the local Coulomb interaction between neighboring ions. We discuss gate speeds and tolerance to experimental noise for different probabilistic entanglement schemes.

2010 ◽  
Vol 08 (01n02) ◽  
pp. 337-394 ◽  
Author(s):  
S. OLMSCHENK ◽  
D. HAYES ◽  
D. N. MATSUKEVICH ◽  
P. MAUNZ ◽  
D. L. MOEHRING ◽  
...  

Trapped atomic ions have proven to be one of the most promising candidates for the realization of quantum computation due to their long trapping times, excellent coherence properties, and exquisite control of the internal atomic states. Integrating ions (quantum memory) with photons (distance link) offers a unique path to large-scale quantum computation and long-distance quantum communication. In this article, we present a detailed review of the experimental implementation of a heralded photon-mediated quantum gate between remote ions, and the employment of this gate to perform a teleportation protocol between two ions separated by a distance of about one meter.


2013 ◽  
Vol 13 (5&6) ◽  
pp. 361-378
Author(s):  
Tomas Jochym-O'Connor ◽  
Yafei Yu ◽  
Bassam Helou ◽  
Raymond Laflamme

Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the Clifford gate set and as such their usefulness for universal quantum computation is of great interest. Clifford group gates augmented by magic state preparation give the possibility of simulating universal quantum computation. However, experimentally one cannot expect to perfectly prepare magic states. Nonetheless, it has been shown that by repeatedly applying operations from the Clifford group and measurements in the Pauli basis, the fidelity of noisy prepared magic states can be increased arbitrarily close to a pure magic state~\cite{Bravyi}. We investigate the robustness of magic state distillation to perturbations of the initial states to arbitrary locations in the Bloch sphere due to noise. Additionally, we consider a depolarizing noise model on the quantum gates in the decoding section of the distillation protocol and demonstrate its effect on the convergence rate and threshold value. Finally, we establish that faulty magic state distillation is more efficient than fault-tolerance-assisted magic state distillation at low error rates due to the large overhead in the number of quantum gates and qubits required in a fault-tolerance architecture. The ability to perform magic state distillation with noisy gates leads us to conclude that this could be a realistic scheme for future small-scale quantum computing devices as fault-tolerance need only be used in the final steps of the protocol.


2019 ◽  
Vol 17 (03) ◽  
pp. 1950020
Author(s):  
Abderrahim Benmachiche ◽  
Ali Sellami ◽  
Sherzod Turaev ◽  
Derradji Bahloul ◽  
Azeddine Messikh ◽  
...  

Fundamental quantum gates can be implemented effectively using adiabatic quantum computation or circuit model. Recently, Hen combined the two approaches to introduce a new model called controlled adiabatic evolutions [I. Hen, Phys. Rev. A, 91(2) (2015) 022309]. This model was specifically designed to implement one and two-qubit controlled gates. Later, Santos extended Hen’s work to implement [Formula: see text]-qubit controlled gates [A. C. Santos and M. S. Sarandy, Sci. Rep., 5 (2015) 15775]. In this paper, we discuss the implementation of each of the usual quantum gates, as well as demonstrate the possibility of preparing Bell’s states using the controlled adiabatic evolutions approach. We conclude by presenting the fidelity results of implementing single quantum gates and Bell’s states in open systems.


2018 ◽  
Author(s):  
Florian Meier ◽  
Andreas-David Brunner ◽  
Scarlet Koch ◽  
Heiner Koch ◽  
Markus Lubeck ◽  
...  

ABSTRACTIn bottom-up proteomics, peptides are separated by liquid chromatography with elution peak widths in the range of seconds, while mass spectra are acquired in about 100 microseconds with time-of-fight (TOF) instruments. This allows adding ion mobility as a third dimension of separation. Among several formats, trapped ion mobility spectrometry (TIMS) is attractive due to its small size, low voltage requirements and high efficiency of ion utilization. We have recently demonstrated a scan mode termed parallel accumulation – serial fragmentation (PASEF), which multiplies the sequencing speed without any loss in sensitivity (Meier et al., PMID: 26538118). Here we introduce the timsTOF Pro instrument, which optimally implements online PASEF. It features an orthogonal ion path into the ion mobility device, limiting the amount of debris entering the instrument and making it very robust in daily operation. We investigate different precursor selection schemes for shotgun proteomics to optimally allocate in excess of 100 fragmentation events per second. More than 800,000 fragmentation spectra in standard 120 min LC runs are easily achievable, which can be used for near exhaustive precursor selection in complex mixtures or re-sequencing weak precursors. MaxQuant identified more than 6,400 proteins in single run HeLa analyses without matching to a library, and with high quantitative reproducibility (R > 0.97). Online PASEF achieves a remarkable sensitivity with more than 2,900 proteins identified in 30 min runs of only 10 ng HeLa digest. We also show that highly reproducible collisional cross sections can be acquired on a large scale (R > 0.99). PASEF on the timsTOF Pro is a valuable addition to the technological toolbox in proteomics, with a number of unique operating modes that are only beginning to be explored.


Science ◽  
2019 ◽  
Vol 364 (6443) ◽  
pp. 875-878 ◽  
Author(s):  
Yong Wan ◽  
Daniel Kienzler ◽  
Stephen D. Erickson ◽  
Karl H. Mayer ◽  
Ting Rei Tan ◽  
...  

Large-scale quantum computers will require quantum gate operations between widely separated qubits. A method for implementing such operations, known as quantum gate teleportation (QGT), requires only local operations, classical communication, and shared entanglement. We demonstrate QGT in a scalable architecture by deterministically teleporting a controlled-NOT (CNOT) gate between two qubits in spatially separated locations in an ion trap. The entanglement fidelity of our teleported CNOT is in the interval (0.845, 0.872) at the 95% confidence level. The implementation combines ion shuttling with individually addressed single-qubit rotations and detections, same- and mixed-species two-qubit gates, and real-time conditional operations, thereby demonstrating essential tools for scaling trapped-ion quantum computers combined in a single device.


2018 ◽  
Vol 4 (1) ◽  
pp. 014004 ◽  
Author(s):  
G Pagano ◽  
P W Hess ◽  
H B Kaplan ◽  
W L Tan ◽  
P Richerme ◽  
...  

2003 ◽  
Vol 01 (01) ◽  
pp. 1-23 ◽  
Author(s):  
VLATKO VEDRAL

In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also introduce a number of examples that will help the reader understand the basic issues involved. In the second part we show how to perform a universal quantum computation using only geometric effects appearing in quantum phases. It is then finally discussed how this geometric way of performing quantum gates can lead to a stable, large scale, intrinsically fault-tolerant quantum computer.


Sign in / Sign up

Export Citation Format

Share Document