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

An Improving Scheme of Quantum Simulation of Pairing Model on an NMR Quantum Computer

An Min Wang, Xiaodong Yang

Published Oct 1, 2004• 0 citations
OpenAlex

Abstract

We propose an improving scheme of quantum simulation of pairing model on an NMR quantum computer. Our scheme simplifies the preparation of the initial state, does not need the rotation step, clarifies the role of NMR measure and uses the second (discrete) Fourier transformation to obtain the spectrum of paring model. We concretely discuss the case in the concerned subspaces of pairing model and then, as an example, give out a simple and easily prepared initial state to get the gap of two the lowest energy levels in the given subspace. The quantum simulation to get more differences of energy levels is able to be discussed similarly.

Related papers

Use of pairs of pseudopure states for NMR quantum computing

B. M. Fung

The premise of nuclear magnetic resonance (NMR) quantum computing is that pseudopure quantum states, for which the populations of all energy levels but one are equal, can be used instead of pure quantum states. However, for systems with a large number of quantum bits (qubits), it would require elaborate pulse sequences with many steps to prepare these pseudopure states. To overcome this problem, a method using pairs of pseudopure states (POPS) instead of individual pseudopure states as the basis for NMR quantum computing is introduced here. The POPS approach has a significant advantage over the existing methods that, regardless of the number of qubits, only a single step is needed to prepare each pair of pseudopure states. A detailed analysis of a 16-level spin system is given, and the results of applying a ${c}^{2}$-NOT quantum logic gate (a controlled-NOT gate conditional upon the state of two other qubits) to all the POPS in the system are presented.

Physical Review A•Jan 12, 2001•28 citations

NMR Implementation of a Molecular Hydrogen Quantum Simulation with Adiabatic State Preparation

Jiangfeng Du, Nanyang Xu, Xinhua Peng +3 more

It is difficult to simulate quantum systems on classical computers, while quantum computers have been proved to be able to efficiently perform such kinds of simulations. We report an NMR implementation simulating the hydrogen molecule (H2) in a minimal basis to obtain its ground-state energy. Using an iterative NMR interferometer to measure the phase shift, we achieve a 45-bit estimation of the energy value. The efficiency of the adiabatic state preparation is also experimentally tested with various configurations of the same molecule.

arXiv:0907.3642•Physical Review Letters•Jan 22, 2010•275 citations

Quantum Simulation of 2p-π Electronic Hamiltonian in Molecular Ethylene by Using an NMR Quantum Computer

Deniz Türkpençe, Azmi Gençten

Classical simulation of a quantum system is a hard problem. It’s known that these problems can be solved efficiently by using quantum computers. This study demonstrates the simulation of the molecular Hamiltonian of 2p-π electrons of ethylene in order to calculate the ground state energy. The ground state energy is estimated by an iterative phase estimation algorithm. The ground state is prepared by the adiabatic state preparation and the implementation of the procedure is carried out by numerical simulation of two-qubit NMR quantum simulator. The readout scheme of the simulator is performed by extracting binary bits via NMR interferometer.

Journal of Quantum Information Science•Jan 1, 2013•0 citations

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

Silicon-Based NMR Quantum Computer Using Single Electron

А. А. Ларионов, Leonid Evgenevich Fedichkin, K. A. Valiev

A new NMR quantum computer scheme based on semiconductor nanostructure is proposed. Energy spectrum of the spin-qubit system was obtained. Methods of single and two qubit gates realization are discussed. This variant of quantum computer is more simple to control and more coherent.

•Jun 1, 2001•0 citations

Simulating NMR Spectra with a Quantum Computer

Joaquín Ossorio-Castillo, Alexandre Rodríguez-Coello

The procedure for simulating the nuclear magnetic resonance spectrum linked to the spin system of a molecule for a certain nucleus entails diagonalizing the associated Hamiltonian matrix. As the dimensions of said matrix grow exponentially with respect to the spin system's atom count, the calculation of the eigenvalues and eigenvectors marks the performance of the overall process. The aim of this paper is to provide a formalization of the complete procedure of the simulation of a spin system's NMR spectrum while also explaining how to diagonalize the Hamiltonian matrix with a quantum computer, thus enhancing the overall process's performance. Two well-known quantum algorithms for calculating the eigenvalues of a matrix are analyzed and put to the test in this context: quantum phase estimation and the variational quantum eigensolver. Additionally, we present simulated results for the later approach while also addressing the hypothetical noise found in a physical quantum computer.

arXiv:2410.20836•Oct 28, 2024•4 citations
We propose an improving scheme of quantum simulation of pairing model on an NMR quantum computer. Our scheme simplifies the preparation of the initial state, does not need the rotation step, clarifies the role of NMR measure and uses the second (discrete) Fourier transformation to obtain the spectrum of paring model. We concretely discuss the case in the concerned subspaces of pairing model and then, as an example, give out a simple and easily prepared initial state to get the gap of two the lowest energy levels in the given subspace. The quantum simulation to get more differences of energy levels is able to be discussed similarly.
The premise of nuclear magnetic resonance (NMR) quantum computing is that pseudopure quantum states, for which the populations of all energy levels but one are equal, can be used instead of pure quantum states. However, for systems with a large number of quantum bits (qubits), it would require elaborate pulse sequences with many steps to prepare these pseudopure states. To overcome this problem, a method using pairs of pseudopure states (POPS) instead of individual pseudopure states as the basis for NMR quantum computing is introduced here. The POPS approach has a significant advantage over the existing methods that, regardless of the number of qubits, only a single step is needed to prepare each pair of pseudopure states. A detailed analysis of a 16-level spin system is given, and the results of applying a c2{c}^{2}c2-NOT quantum logic gate (a controlled-NOT gate conditional upon the state of two other qubits) to all the POPS in the system are presented.
It is difficult to simulate quantum systems on classical computers, while quantum computers have been proved to be able to efficiently perform such kinds of simulations. We report an NMR implementation simulating the hydrogen molecule (H2) in a minimal basis to obtain its ground-state energy. Using an iterative NMR interferometer to measure the phase shift, we achieve a 45-bit estimation of the energy value. The efficiency of the adiabatic state preparation is also experimentally tested with various configurations of the same molecule.
Classical simulation of a quantum system is a hard problem. It’s known that these problems can be solved efficiently by using quantum computers. This study demonstrates the simulation of the molecular Hamiltonian of 2p-π electrons of ethylene in order to calculate the ground state energy. The ground state energy is estimated by an iterative phase estimation algorithm. The ground state is prepared by the adiabatic state preparation and the implementation of the procedure is carried out by numerical simulation of two-qubit NMR quantum simulator. The readout scheme of the simulator is performed by extracting binary bits via NMR interferometer.
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.
The procedure for simulating the nuclear magnetic resonance spectrum linked to the spin system of a molecule for a certain nucleus entails diagonalizing the associated Hamiltonian matrix. As the dimensions of said matrix grow exponentially with respect to the spin system's atom count, the calculation of the eigenvalues and eigenvectors marks the performance of the overall process. The aim of this paper is to provide a formalization of the complete procedure of the simulation of a spin system's NMR spectrum while also explaining how to diagonalize the Hamiltonian matrix with a quantum computer, thus enhancing the overall process's performance. Two well-known quantum algorithms for calculating the eigenvalues of a matrix are analyzed and put to the test in this context: quantum phase estimation and the variational quantum eigensolver. Additionally, we present simulated results for the later approach while also addressing the hypothetical noise found in a physical quantum computer.