IMPLEMENTATION OF QUANTUM LOGIC OPERATIONS AND CREATION OF ENTANGLEMENT BETWEEN TWO NUCLEAR SPIN QUBITS WITH CONSTANT INTERACTION

2006 ◽  
Vol 04 (06) ◽  
pp. 975-1001
Author(s):  
G. P. BERMAN ◽  
G. W. BROWN ◽  
M. E. HAWLEY ◽  
D. I. KAMENEV ◽  
V. I. TSIFRINOVICH

We describe how to implement quantum logic operations in a silicon-based quantum computer with phosphorus atoms serving as qubits. The information is stored in the states of nuclear spins and the conditional logic operations are implemented through the electron spins using nuclear–electron hyperfine and electron–electron exchange interactions. The electrons in our computer should stay coherent only during implementation of one Controlled-NOT gate. The exchange interaction is constant, and selective excitations are provided by a magnetic field gradient. The quantum logic operations are implemented by rectangular radio-frequency pulses. This architecture is scalable and does not require manufacturing nanoscale electronic gates. As shown in this paper, parameters of a quantum protocol can be derived analytically even for a computer with a large number of qubits using our perturbation approach. We present the protocol for initialization of the nuclear spins and the protocol for creation of entanglement. All analytical results are tested numerically using a two-qubit system.

1999 ◽  
Vol 60 (2) ◽  
pp. 917-936 ◽  
Author(s):  
J. D. Franson ◽  
T. B. Pittman

2000 ◽  
Vol 61 (6) ◽  
Author(s):  
G. P. Berman ◽  
G. D. Doolen ◽  
G. V. López ◽  
V. I. Tsifrinovich

2009 ◽  
Vol 07 (06) ◽  
pp. 1053-1203 ◽  
Author(s):  
ROBERT RAUßENDORF

In this thesis, we describe the one-way quantum computer [Formula: see text], a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the [Formula: see text], describe the underlying computational model and demonstrate that the [Formula: see text] can be operated fault-tolerantly. In Sec. 2, we show that the [Formula: see text] can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model — the common model of quantum computation. We also indicate that the description of the [Formula: see text] as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the [Formula: see text], which is very different from the quantum logic network model. The [Formula: see text] has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of [Formula: see text] quantum algorithms. Further, all information that is processed with the [Formula: see text] is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The [Formula: see text] is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the [Formula: see text]. Further, we outline the concept of checksums in the context of the [Formula: see text], which may become an element in future practical and adequate methods for fault-tolerant [Formula: see text] computation.


2011 ◽  
Vol 20 (12) ◽  
pp. 120310
Author(s):  
Ying-Qiao Zhang ◽  
Shou Zhang ◽  
Kyu-Hwang Yeon ◽  
Seong-Cho Yu

2021 ◽  
Vol 15 (6) ◽  
Author(s):  
Andre R. R. Carvalho ◽  
Harrison Ball ◽  
Michael J. Biercuk ◽  
Michael R. Hush ◽  
Felix Thomsen

2018 ◽  
Vol 9 ◽  
pp. 2668-2673 ◽  
Author(s):  
José Carlos Abadillo-Uriel ◽  
Belita Koiller ◽  
María José Calderón

Since the proposal in 1998 to build a quantum computer using dopants in silicon as qubits, much progress has been made in the nanofabrication of semiconductors and the control of charge and spins in single dopants. However, an important problem remains unsolved, namely the control over exchange interactions and tunneling between two donors, which presents a peculiar oscillatory behavior as the dopants relative positions vary at the scale of the lattice parameter. Such behavior is due to the valley degeneracy in the conduction band of silicon, and does not occur when the conduction-band edge is at k = 0. We investigate the possibility of circumventing this problem by using two-dimensional (2D) materials as hosts. Dopants in 2D systems are more tightly bound and potentially easier to position and manipulate. Moreover, many of them present the conduction band minimum at k = 0, thus no exchange or tunnel coupling oscillations. Considering the properties of currently available 2D semiconductor materials, we access the feasibility of such a proposal in terms of quantum manipulability of isolated dopants (for single qubit operations) and dopant pairs (for two-qubit operations). Our results indicate that a wide variety of 2D materials may perform at least as well as, and possibly better, than the currently studied bulk host materials for donor qubits.


Sign in / Sign up

Export Citation Format

Share Document