Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Time Evolution of Quantum Computer

Michimasa Sugimura

Published Jan 1, 2001• 0 citations
OpenAlex

Abstract

Deutsch formulated in 1985 a new computer based on quantummechanics. In quantum computers, the ones and zeros of classical digital computers are replaced by the quantum state of a two-level system which is named qubit. Computation, i.e., a sequence of unitary transformations, simultaneously affects each element of the superposition, generating a massive parallel data processing, albeit within one piece of quantum hardware. Practical quantum computer requires preventing decoherence (uncontrolled interaction of a quantum system with its surrounding environment) in order to maintain the superposition. In 1998, Kane proposed the scheme of implementing a quantum computer on an array of nuclear spins located on donors in silicon. Because nuclear spins are extremely well isolated from environment, operations on nuclear-spin qubits could have low error rates. Quantum logic gate is performed by transitions between the different energy levels of the electron-nuclear spin states, which is induced by a radio-frequency magnetic field B applied at a frequency resonant with the energy-level difference. In this study, we numerically simulated the quantum logic gate of Kane’s quantum computer, by neglecting the complications generated from the band structure in Si. For the calculation of the time evolution of the quantum logic gate, we compute the transition probability between the energy levels of electron-nuclear spin states under the influence of a time-dependent perturbation.

Related papers

Modelling Molecular Technologies for Nuclear Magnetic Resonance Quantum Computing

Mario Simoni

Standard CMOS circuits are expected to be no longer able to satisfy nowadays demand for higher performances and lower power consumption. This commits to look for new solutions. Quantum computation, whose fundamental quantity of information is the qubit, is a thoroughly new way of thinking to electronics. There are at least two main reasons for which quantum computing is expected to broaden computation horizons. First, specific algorithms can be engineered, manipulating the probability amplitudes of different states, to exploit the quantum superposition principle and achieve high parallelism. Second, it is expected to be spontaneously suitable to simulate complex quantum physical systems, as large molecules. Quantum computing requires the cooperation of several scientific fields. The leading idea has been to highlight the operations and algorithms a quantum computer must be able to perform and, then, to propose a hardware solution, providing the rigorous physical treatment mandatory for a deep understanding and for an appropriate modelling, something which is hard to find in nowadays literature. Thus, the first chapters address the quantum algorithms, focusing on Grover's search algorithm and deriving, from fundamentals, the corresponding circuit. The latter is then described in Quantum Assembly (QASM), which can be seen as the quantum equivalent of VHDL, and simulated on IBM Q Experience. The following chapters deal with a possible physical implementation of quantum processors: the encoding of qubits on nuclear spins in diamagnetic molecules. When a static magnetic field is applied to a spin-1/2 nucleus, two well-defined energy eigenstates arise, as a result of the Zeeman effect. Each of them can be associated with a qubit eigenstate. Thanks to nuclear magnetic resonance principles, the probability with which one of the two eigenstates is measured can be handled by the superposition of a radio frequency field at the resonance frequency of the nucleus. This can be interpreted as a rotation of the spin, and so of the qubit, about the RF field and enables the execution of single qubit quantum gates, since they are simple rotations of the state vector. The two-qubit CNOT gate is obtained through the interaction of spins via J-coupling. Considering that these gates constitute a universal set, every quantum algorithm can theoretically be run on an NMR processor. Different nuclei have different resonant frequencies, but the addressing of a specific spin can be achieved also in homonuclear molecules, since the resonant frequency depends also on the nuclear environment (nuclear shielding). While unwanted J-couplings can be removed thanks to refocusing, spin decoherence and relaxation phenomena force an upper limit to the allowed timescale. A main advantage of NMR is that this timescale is long, even at room temperature. Conversely, scalability is still an issue. A simple heteronuclear MATLAB model, based on the relations derived from first principles in the thesis, is proposed to prove the feasibility of NMR quantum processors. The input technological parameters, as chemical shielding and J-coupling, can be computed resorting on ORCA, or obtained from experimental data. The model, able to run a universal set of quantum gates and simple algorithms, can be useful to find an optimal operating point as a compromise between molecule physical properties and the quantities which can be controlled by nowadays NMR instrumentation.

•Apr 1, 2020•0 citations

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

G. P. Berman, Geoffrey W. Brown, M. E. Hawley +2 more

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.

International Journal of Quantum Information•Dec 1, 2006•0 citations

Dynamics of nuclear spin measurement in a mesoscopic solid-state quantum computer

G. P. Berman, David K Campbell, Gary D. Doolen +1 more

We study numerically the process of nuclear spin measurement in a solid-state quantum computer of the type proposed by Kane, by calculating the quantum dynamics of two coupled nuclear spins on 31 P donors implanted in 28 Si. We estimate the time of the `quantum swap operation' - the minimum measurement time required for the reliable transfer of quantum information from the nuclear spin subsystem to the electronic subsystem. Our calculations show that for realistic values of the parameters this time is of the order of swap ~5 × 10 -5 s. We also calculate the probability of error for typical values of the external noise.

Journal of Physics Condensed Matter•Mar 15, 2000•7 citations

Two qubits in pure nuclear quadrupole resonance

G. B. Furman, S. D. Goren, V. Meerovich +1 more

It is shown theoretically that by the use of two radio-frequency fields of the same resonance frequency but with the different phases and directions the degeneracy of the energy spectrum of a spin system with I = 3/2 is removed. This leads to four non-degenerate spin states which can be used as a platform for quantum computing. The feasibility of quantum computing based on a pure (without DC magnetic fields) nuclear quadrupole resonance technique is investigated in detail. Various quantum logic gates can be constructed by using different excitation techniques allowing different manipulations with the spin system states. Three realizations of quantum logic gates are considered: the application of an additional magnetic field with the resonance frequency, the amplitude modulation of one of the applied RF fields by the resonance frequency field, and the level-crossing method. It is shown that the probabilities of the resonance transitions depend on the method of excitation and on the direction of the excitation field. Feasibility of quantum computing is demonstrated with the examples of constructing a controlled-NOT logic gate using the resonance excitation technique and SWAP and NOT2 logic gates using the level-crossing method.

Journal of Physics Condensed Matter•Sep 5, 2002•13 citations

Unitary transformations for quantum computing

Juha J. Vartiainen

The last two decades have seen an enormous increase in the computational power of digital computers. This was due to the rapid technical development in manufacturing processes and controlling semiconducting structures on submicron scale. Concurrently, the electric circuits have encountered the first signs of the realm of quantum mechanics. Those effects may induce noise and thus they are typically considered harmful. However, the manipulation of the coherent quantum states might turn out be the basis of powerful computers – quantum computers. There, the computation is encoded into the unitary time evolution of a quantum mechanical state vector. Eventually, quantum mechanics could enable one, for example, to read secret electronic messages which are encrypted by the widely employed RSA cryptosystem – a task which is extremely laborious for the current digital computers. This thesis presents a theoretical study of the coherent manipulations of pure quantum states in a quantum register, that is, quantum algorithms. An implementation of a quantum algorithm involves the initialization of the input state and its manipulation with quantum gates followed by the measurements. The physical implementation of each gate requires that it is decomposed into low-level gates whose physical realizations are explicitly known. Here, the problem is examined from two directions. Firstly, the numerical optimization scheme for controlling time-evolution of a closed quantum system is discussed. This yields a method for implementing quantum gates acting on up to three quantum bits, qubits. The approach is independent of the physical realization of the quantum computer, but it is considered explicitly for a proposed inductively coupled Josephson charge qubit register. Secondly, the techniques of numerical matrix computation are utilized to find a general method for decomposing an arbitrary n-qubit gate into a sequence of elementary gates, which act on one or two qubits. The results of this thesis help to improve the implementation of quantum algorithms. The quantum circuit construction developed in the thesis is the first one to achieve the asymptotically minimal complexity in the number of elementary gates. In context of acceleration of quantum algorithms we present a gate-level study of Shor's algorithm and show how to accelerate the algorithm by merging several elementary gates into multiqubit gates. Finally, the requirements set by the resulting gate array are compared to the properties of superconducting qubits. This allows us to discuss the feasibility of the Josephson charge qubit register, for instance, as hardware for breaking the RSA cryptosystem.

•Apr 8, 2005•2 citations

Electron-Nuclear Spin Dynamics in a Mesoscopic Solid-State Quantum Computer

G. P. Berman, David K Campbell, G. D. Doolen +1 more

We numerically simulate the process of nuclear spin measurement in Kane's quantum computer. For this purpose, we model the quantum dynamics of two coupled nuclear spins located on {sup 31}P donors implanted in Si. We estimate the minimum time of measurement necessary for the reliable transfer of quantum information from the nuclear spin subsystem to the electronic one and the probability of error for typical values of external noise.

•Dec 7, 1998•0 citations
Deutsch formulated in 1985 a new computer based on quantummechanics. In quantum computers, the ones and zeros of classical digital computers are replaced by the quantum state of a two-level system which is named qubit. Computation, i.e., a sequence of unitary transformations, simultaneously affects each element of the superposition, generating a massive parallel data processing, albeit within one piece of quantum hardware. Practical quantum computer requires preventing decoherence (uncontrolled interaction of a quantum system with its surrounding environment) in order to maintain the superposition. In 1998, Kane proposed the scheme of implementing a quantum computer on an array of nuclear spins located on donors in silicon. Because nuclear spins are extremely well isolated from environment, operations on nuclear-spin qubits could have low error rates. Quantum logic gate is performed by transitions between the different energy levels of the electron-nuclear spin states, which is induced by a radio-frequency magnetic field B applied at a frequency resonant with the energy-level difference. In this study, we numerically simulated the quantum logic gate of Kane’s quantum computer, by neglecting the complications generated from the band structure in Si. For the calculation of the time evolution of the quantum logic gate, we compute the transition probability between the energy levels of electron-nuclear spin states under the influence of a time-dependent perturbation.
Standard CMOS circuits are expected to be no longer able to satisfy nowadays demand for higher performances and lower power consumption. This commits to look for new solutions. Quantum computation, whose fundamental quantity of information is the qubit, is a thoroughly new way of thinking to electronics. There are at least two main reasons for which quantum computing is expected to broaden computation horizons. First, specific algorithms can be engineered, manipulating the probability amplitudes of different states, to exploit the quantum superposition principle and achieve high parallelism. Second, it is expected to be spontaneously suitable to simulate complex quantum physical systems, as large molecules. Quantum computing requires the cooperation of several scientific fields. The leading idea has been to highlight the operations and algorithms a quantum computer must be able to perform and, then, to propose a hardware solution, providing the rigorous physical treatment mandatory for a deep understanding and for an appropriate modelling, something which is hard to find in nowadays literature. Thus, the first chapters address the quantum algorithms, focusing on Grover's search algorithm and deriving, from fundamentals, the corresponding circuit. The latter is then described in Quantum Assembly (QASM), which can be seen as the quantum equivalent of VHDL, and simulated on IBM Q Experience. The following chapters deal with a possible physical implementation of quantum processors: the encoding of qubits on nuclear spins in diamagnetic molecules. When a static magnetic field is applied to a spin-1/2 nucleus, two well-defined energy eigenstates arise, as a result of the Zeeman effect. Each of them can be associated with a qubit eigenstate. Thanks to nuclear magnetic resonance principles, the probability with which one of the two eigenstates is measured can be handled by the superposition of a radio frequency field at the resonance frequency of the nucleus. This can be interpreted as a rotation of the spin, and so of the qubit, about the RF field and enables the execution of single qubit quantum gates, since they are simple rotations of the state vector. The two-qubit CNOT gate is obtained through the interaction of spins via J-coupling. Considering that these gates constitute a universal set, every quantum algorithm can theoretically be run on an NMR processor. Different nuclei have different resonant frequencies, but the addressing of a specific spin can be achieved also in homonuclear molecules, since the resonant frequency depends also on the nuclear environment (nuclear shielding). While unwanted J-couplings can be removed thanks to refocusing, spin decoherence and relaxation phenomena force an upper limit to the allowed timescale. A main advantage of NMR is that this timescale is long, even at room temperature. Conversely, scalability is still an issue. A simple heteronuclear MATLAB model, based on the relations derived from first principles in the thesis, is proposed to prove the feasibility of NMR quantum processors. The input technological parameters, as chemical shielding and J-coupling, can be computed resorting on ORCA, or obtained from experimental data. The model, able to run a universal set of quantum gates and simple algorithms, can be useful to find an optimal operating point as a compromise between molecule physical properties and the quantities which can be controlled by nowadays NMR instrumentation.
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.
We study numerically the process of nuclear spin measurement in a solid-state quantum computer of the type proposed by Kane, by calculating the quantum dynamics of two coupled nuclear spins on 31 P donors implanted in 28 Si. We estimate the time of the `quantum swap operation' - the minimum measurement time required for the reliable transfer of quantum information from the nuclear spin subsystem to the electronic subsystem. Our calculations show that for realistic values of the parameters this time is of the order of swap ~5 × 10 -5 s. We also calculate the probability of error for typical values of the external noise.
It is shown theoretically that by the use of two radio-frequency fields of the same resonance frequency but with the different phases and directions the degeneracy of the energy spectrum of a spin system with I = 3/2 is removed. This leads to four non-degenerate spin states which can be used as a platform for quantum computing. The feasibility of quantum computing based on a pure (without DC magnetic fields) nuclear quadrupole resonance technique is investigated in detail. Various quantum logic gates can be constructed by using different excitation techniques allowing different manipulations with the spin system states. Three realizations of quantum logic gates are considered: the application of an additional magnetic field with the resonance frequency, the amplitude modulation of one of the applied RF fields by the resonance frequency field, and the level-crossing method. It is shown that the probabilities of the resonance transitions depend on the method of excitation and on the direction of the excitation field. Feasibility of quantum computing is demonstrated with the examples of constructing a controlled-NOT logic gate using the resonance excitation technique and SWAP and NOT2 logic gates using the level-crossing method.
The last two decades have seen an enormous increase in the computational power of digital computers. This was due to the rapid technical development in manufacturing processes and controlling semiconducting structures on submicron scale. Concurrently, the electric circuits have encountered the first signs of the realm of quantum mechanics. Those effects may induce noise and thus they are typically considered harmful. However, the manipulation of the coherent quantum states might turn out be the basis of powerful computers – quantum computers. There, the computation is encoded into the unitary time evolution of a quantum mechanical state vector. Eventually, quantum mechanics could enable one, for example, to read secret electronic messages which are encrypted by the widely employed RSA cryptosystem – a task which is extremely laborious for the current digital computers. This thesis presents a theoretical study of the coherent manipulations of pure quantum states in a quantum register, that is, quantum algorithms. An implementation of a quantum algorithm involves the initialization of the input state and its manipulation with quantum gates followed by the measurements. The physical implementation of each gate requires that it is decomposed into low-level gates whose physical realizations are explicitly known. Here, the problem is examined from two directions. Firstly, the numerical optimization scheme for controlling time-evolution of a closed quantum system is discussed. This yields a method for implementing quantum gates acting on up to three quantum bits, qubits. The approach is independent of the physical realization of the quantum computer, but it is considered explicitly for a proposed inductively coupled Josephson charge qubit register. Secondly, the techniques of numerical matrix computation are utilized to find a general method for decomposing an arbitrary n-qubit gate into a sequence of elementary gates, which act on one or two qubits. The results of this thesis help to improve the implementation of quantum algorithms. The quantum circuit construction developed in the thesis is the first one to achieve the asymptotically minimal complexity in the number of elementary gates. In context of acceleration of quantum algorithms we present a gate-level study of Shor's algorithm and show how to accelerate the algorithm by merging several elementary gates into multiqubit gates. Finally, the requirements set by the resulting gate array are compared to the properties of superconducting qubits. This allows us to discuss the feasibility of the Josephson charge qubit register, for instance, as hardware for breaking the RSA cryptosystem.