The three-qubit conditional swap gate(Fredkin gate) is a universal gate that can be used to create any logic circuit and has many direct usages. In this paper, we experimentally realized Fredkin gate with only three transition pulses in solution of alanine. It appears that no experimental realization of Fredkin gate with fewer pulses has yet been reported up to now. In addition, the simple structure of our scheme makes it easy to be implemented in experiments.
Schemes of experimental realization of the main two qubit processors for quantum computers and Deutsch-Jozsa algorithm are derived in virtual spin representation. The results are applicable for every four quantum states allowing the required properties for quantum processor implementation if for qubit encoding virtual spin representation is used. Four dimensional Hilbert space of nuclear spin 3/2 is considered in details for this aim
Interaction of molecules with light may lead to electronic transitions and simultaneous vibrational excitations. Franck-Condon factors (FCFs) play an important role in quantifying the intensities of such vibronic transitions occurring during molecular photo-excitations. In this article, we describe a general method for estimating FCFs using a quantum information processor. The method involves the application of a translation operator followed by the measurement of certain projections. We also illustrate the method by experimentally estimating FCFs with the help of a three-qubit NMR quantum inf…
Recently quantum states discrimination has been frequently studied. In this paper we study them from the other way round, the likeness of two quantum states. The fidelity is used to describe the likeness of two quantum states. Then we presented a scheme to obtain the fidelity of two unknown qubits directly from the integral area of the spectra of the assistant qubit(spin) on an NMR Quantum Information Processor. Finally we demonstrated the scheme on a three-qubit quantum information processor. The experimental data are consistent with the theoretical expectation with an average error of 0.05, …
We describe the experimental implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits using NMR. The algorithm solves a generalisation of the Deutsch problem and distinguishes between even and odd functions using fewer function calls than is possible classically. The manipulation of entangled states of the two qubits is essential here, unlike the Deutsch-Jozsa algorithm and the Grover's search algorithm for two bits.
The existence of contextuality in quantum mechanics is a fundamental departure from the classical description of the world. Currently, the quest to identify scenarios which cannot be more contextual than quantum theory is at the forefront of research in quantum contextuality. In this work, we experimentally test two inequalities, which are capable of revealing fully contextual quantum correlations, on a Hilbert space of dimension 8 and 4 respectively, on an NMR quantum information processor. The projectors associated with the contextuality inequalities are first reformulated in terms of Pauli …
Estimation of quantum states is one of the most important steps in any quantum information processing experiment. A naive reconstruction of the density matrix from experimental measurements can often give density matrices which are not positive, and hence not physically acceptable. How do we ensure that at all stages of reconstruction, we keep the density matrix positive and normalized? Recently a method has been suggested based on maximum likelihood estimation, wherein the density matrix is guaranteed to be positive definite. We experimentally implement this protocol and demonstrate its utili…
We present the first NMR implementation of a scheme for selective and efficient quantum process tomography without ancilla. We generalize this scheme such that it can be implemented efficiently using only a set of measurements involving product operators. The method allows us to estimate any element of the quantum process matrix to a desired precision, provided a set of quantum states can be prepared efficiently. Our modified technique requires fewer experimental resources as compared to the standard implementation of selective and efficient quantum process tomography, as it exploits the speci…
Random local measurements have recently been proposed to construct entanglement witnesses and thereby detect the presence of bipartite entanglement. We experimentally demonstrate the efficacy of one such scheme on a two-qubit NMR quantum information processor. We show that a set of three random local measurements suffices to detect the entanglement of a general two-qubit state. We experimentally generate states with different amounts of entanglement, and show that the scheme is able to clearly witness entanglement. We perform complete quantum state tomography for each state and compute state f…
We give a general method of construting quantum circuit for random \QTR{it}{satisfiability} (SAT) problems with the basic logic gates such as multi-qubit controlled-NOT and NOT gates. The sizes of these circuits are almost the same as the sizes of the SAT formulas. Further, a parallelization scheme is described to solve random SAT problems efficiently through these quantum circuits in \QTR{it}{nuclear magnetic resonance} (NMR) ensemble quantum computing. This scheme exploits truly mixed states as input states rather than pseudo-pure states, and combines with the topological nanture of the NMR …
We present an experimental implementation of the coined discrete time quantum walk on a square using a three qubit liquid state nuclear magnetic resonance (NMR) quantum information processor (QIP). Contrary to its classical counterpart, we observe complete interference after certain steps and a periodicity in the evolution. Complete state tomography has been performed for each of the eight steps making a full period. The results have extremely high fidelity with the expected states and show clearly the effects of quantum interference in the walk. We also show and discuss the importance of choo…
Quantum processors are potentially superior to their classical counterparts for many computational tasks including factorization. Circuit methods as well as adiabatic methods have already been proposed and implemented for finding the factors of a given composite number. The main challenge in scaling it to larger numbers is the unavailability of large number of qubits. Here we propose a hybrid scheme that involves both classical and quantum computation, which reduces the number of qubits required for factorization. The classical part involves setting up and partially simplifying a set of bit-wi…
The ability to post-select the outcomes of an experiment is a useful theoretical concept and experimental tool. In the context of weak measurements post-selection can lead to surprising results such as complex weak values outside the range of eigenvalues. Usually post-selection is realized by a projective measurement, which is hard to implement in ensemble systems such as NMR. We demonstrate the first experiment of a weak measurement with post-selection on an NMR quantum information processor. Our setup is used for measuring complex weak values and weak values outside the range of eigenvalues.…
Anyons have exotic statistical properties, fractional statistics, differing from Bosons and Fermions. They can be created as excitations of some Hamiltonian models. Here we present an experimental demonstration of anyonic fractional statistics by simulating a version of the Kitaev spin lattice model proposed by Han et al[Phys. Rev.Lett. 98, 150404 (2007)] using an NMR quantum information processor. We use a 7-qubit system to prepare a 6-qubit pseudopure state to implement the ground state preparation and realize anyonic manipulations, including creation, braiding and anyon fusion. A $π/2\times…
We present experimental results on the measurement of fidelity decay under contrasting system dynamics using a nuclear magnetic resonance quantum information processor. The measurements were performed by implementing a scalable circuit in the model of deterministic quantum computation with only one quantum bit. The results show measurable differences between regular and complex behaviour and for complex dynamics are faithful to the expected theoretical decay rate. Moreover, we illustrate how the experimental method can be seen as an efficient way for either extracting coarse-grained informatio…
We undertake experimental detection of the entanglement present in arbitrary three-qubit pure quantum states on an NMR quantum information processor. Measurements of only four observables suffice to experimentally differentiate between the six classes of states which are inequivalent under stochastic local operation and classical communication (SLOCC). The experimental realization is achieved by mapping the desired observables onto Pauli $z$-operators of a single qubit, which is directly amenable to measurement. The detection scheme is applied to known entangled states as well as to states ran…
We experimentally explore the state space of three qubits on an NMR quantum information processor. We construct a scheme to experimentally realize a canonical form for general three-qubit states up to single-qubit unitaries. This form involves a non-trivial combination of GHZ and W-type maximally entangled states of three qubits. The general circuit that we have constructed for the generic state reduces to those for GHZ and W states as special cases. The experimental construction of a generic state is carried out for a nontrivial set of parameters and the good fidelity of preparation is confir…
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. In some cases, such as the adiabatic versions of Grover's search algorithm and Deutsch-Jozsa algorithm, applying the global adiabatic evolution yields a complexity similar to their classical algorithms. However, using the local adiabatic evolution, the algorithms given by J. Roland and N. J. Cerf for Grover's search [ Phys. Rev. A. {\bf 65} 0423…
We experimentally demonstrate the freezing of evolution of quantum states in one- and two-dimensional subspaces of two qubits, on an NMR quantum information processor. State evolution was frozen and leakage of the state from its subspace to an orthogonal subspace was successfully prevented using super-Zeno sequences, comprising of a set of inverting radio frequency (rf) pulses punctuated by pre-selected time intervals. We demonstrate the efficacy of the scheme by preserving different types of states, including separable and maximally entangled states in one- and two-dimensional subspaces of tw…
Realizing the Petz Recovery Map on an NMR Quantum Processor
Indian Institute of Science Education & Research Mohali（印度科学教育与研究所莫哈利分校）；Amrita Vishwa Vidyapeetham, Amritapuri（阿姆里塔大学阿姆里塔普里校区）；National Institute for Theoretical and Computational Sciences (NITheCS)（国家理论与计算科学研究所）；Chennai Institute of Technology（金奈理工学院）；Universität Ulm（乌尔姆大学）；Universidade Federal de Pernambuco（伯南布哥联邦大学）
Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in non-classical correlations such as entanglement or quantum discord. However, it has been recently shown that even a single pure qudit is sufficient to design an oracle-based algorithm which solves a black-box problem faster than any classical approach to the same problem. In particular, the algorithm that we consider determines whether eight permutation functions d…
An algorithm based on quantum phase estimation, which discriminates quantum states nondestructively within a set of arbitrary orthogonal states, is described and experimentally verified by a NMR quantum information processor. The procedure is scalable and can be applied to any set of orthogonal states. Scalability is demonstrated through Matlab simulation.
Quantum computing exploits fundamentally new models of computation based on quantum mechanical properties instead of classical physics, and it is believed that quantum computers are able to dramatically improve computational power for particular tasks. At present, nuclear magnetic resonance (NMR) has been one of the most successful platforms amongst all current implementations. It has demonstrated universal controls on the largest number of qubits, and many advanced techniques developed in NMR have been adopted to other quantum systems successfully. In this review, we show how NMR quantum proc…
IQM Quantum Computers（IQM量子计算机）；Ludwig-Maximilians-Universität München（慕尼黑大学）；Department of Physical Chemistry, University of the Basque Country UPV/EHU（巴斯克大学物理化学系）
The non-local nature of the correlations possessed by quantum systems may be revealed by experimental demonstrations of the violation of Bell-type inequalities. Recent work has placed bounds on the correlations that quantum systems can possess in an actual experiment. These bounds were limited to a composite quantum system comprising of a few lower-dimensional subsystems. In a more general approach, it has been shown that fewer body correlations can reveal the non-local nature of the correlations arising from a quantum mechanical description of nature. Such tests on the correlations can be tra…
We have designed efficient quantum circuits for the three-qubit Toffoli (controlled-controlled NOT) and the Fredkin (controlled-SWAP) gate, optimized via genetic programming methods. The gates thus obtained were experimentally implemented on a three-qubit NMR quantum information processor, with a high fidelity. Toffoli and Fredkin gates in conjunction with the single-qubit Hadamard gates form a universal gate set for quantum computing, and are an essential component of several quantum algorithms. Genetic algorithms are stochastic search algorithms based on the logic of natural selection and bi…
We report the implementation of a three-spin quantum disentanglement eraser on a liquid-state NMR quantum information processor. A key feature of this experiment was its use of pulsed magnetic field gradients to mimic projective measurements. This ability is an important step towards the development of an experimentally controllable system which can simulate any quantum dynamics, both coherent and decoherent.
Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring algorithm and its experimental realization to factor the number 143 on a liquid crystal NMR quantum processor with dipole-dipole couplings. We believe this to be the largest number factored in quantum-computation realizations, which shows the practical importance of adiabatic quantum algorithms.
Dymanics of spin dimers in multiple quantum NMR experiment is studied on the 5-qubit superconducting quantum processor of IBM {Quantum Experience} for the both {pure} ground and thermodynamic equilibrium (mixed) initial states. The work can be considered as a first step towards an application of quantum computers to solving problems of magnetic resonance. This article is dedicated to Prof. Klaus Möbius and Prof. Kev Salikhov on the occasion of their 85th birthdays.
We report an ensemble nuclear magnetic resonance (NMR) implementation of a quantum lattice gas algorithm for the diffusion equation. The algorithm employs an array of quantum information processors sharing classical information, a novel architecture referred to as a type-II quantum computer. This concrete implementation provides a test example from which to probe the strengths and limitations of this new computation paradigm. The NMR experiment consists of encoding a mass density onto an array of 16 two-qubit quantum information processors and then following the computation through 7 time step…
We review recent progress made in quantum information processing (QIP) which can be applied in the simulation of quantum systems and chemical phenomena. The review is focused on quantum algorithms which are useful for quantum simulation of chemistry and advances in nuclear magnetic resonance (NMR) and electron spin resonance (ESR) QIP. Discussions also include a number of recent experiments demonstrating the current capabilities of the NMR QIP for quantum simulation and prospects for spin-based implementations of QIP.
We report on the implementation of Burgers equation as a type-II quantum computation on an NMR quantum information processor. Since the flow field evolving under the Burgers equation develops sharp features over time, this is a better test of liquid state NMR implementations of type-II quantum computers than the previous examples using the diffusion equation. In particular, we show that Fourier approximations used in the encoding step are not the dominant error. Small systematic errors in the collision operator accumulate and swamp all other errors. We propose, and demonstrate, that the accumu…
Experimental construction of a symmetric three-qubit entangled state and its utility in testing the violation of a Bell inequality on an NMR quantum simulator
As of today, no one can tell when a universal quantum computer with thousands of logical quantum bits (qubits) will be built. At present, most quantum computer prototypes involve less than ten individually controllable qubits, and only exist in laboratories for the sake of either the great costs of devices or professional maintenance requirements. Moreover, scientists believe that quantum computers will never replace our daily, every-minute use of classical computers, but would rather serve as a substantial addition to the classical ones when tackling some particular problems. Due to the above…
This thesis addresses the problems of initialization and separability in liquid state NMR based quantum information processors. We prepare pure quantum states lying above the entanglement threshold. Our pure state quantum computer derives its purity from the highly polarized nuclear spin states in the para-hydrogen molecule. The thesis begins with a critique of conventional NMR based quantum information processing outlining the major strengths and weaknesses of the technology. We describe the enhanced magnetic ordering of the nuclear spin states in para-hydrogen and an initialization experimen…
We employ a nuclear magnetic resonance (NMR) quantum information processor to simulate the ground state of an XXZ spin chain and measure its NMR analog of entanglement, or pseudo-entanglement. The observed pseudo-entanglement for a small-size system already displays singularity, a signature which is qualitatively similar to that in the thermodynamical limit across quantum phase transitions, including an infinite-order critical point. The experimental results illustrate a successful approach to investigate quantum correlations in many-body systems using quantum simulators.
In building a quantum information processor (QIP), the challenge is to coherently control a large quantum system well enough to perform an arbitrary quantum algorithm and to be able to correct errors induced by decoherence. Nuclear magnetic resonance (NMR) QIPs offer an excellent test-bed on which to develop and benchmark tools and techniques to control quantum systems. Two main issues to consider when designing control methods are accuracy and efficiency, for which two complementary approaches have been developed so far to control qubit registers with liquid-state NMR methods. The first appli…
Nuclear Magnetic Resonance (NMR) forms a natural test-bed to perform quantum information processing (QIP) and has so far proven to be one of the most successful quantum information processors. The nuclear spins in a molecule treated as quantum bits or qubits which are the basic building blocks of a quantum computer. The development of NMR over half a century puts it in a platform where we can utilize its excellent control techniques over an ensemble of spin systems and perform quantum computation in a highly controlled way. Apart from a successful quantum information processor, NMR is also a h…
We introduce the quantum implementation of a binary classifier based on cosine similarity between data vectors. The proposed quantum algorithm evaluates the classifier on a set of data vectors with time complexity that is logarithmic in the product of the set cardinality and the dimension of the vectors. It is based just on a suitable state preparation like the retrieval from a QRAM, a SWAP test circuit (two Hadamard gates and one Fredkin gate), and a measurement process on a single qubit. Furthermore we present a simple implementation of the considered classifier on the IBM quantum processor …
Twirl operations, which convert impure singlet states into Werner states, play an important role in many schemes for entanglement purification. In this paper we describe strategies for implementing twirl operations, with an emphasis on methods suitable for ensemble quantum information processors such as nuclear magnetic resonance (NMR) quantum computers. We implement our twirl operation on a general two-spin mixed state using liquid state NMR techniques, demonstrating that we can obtain the singlet Werner state with high fidelity.
Quantum error correcting codes have been shown to have the ability of making quantum information resilient against noise. Here we show that we can use quantum error correcting codes as diagnostics to characterise noise. The experiment is based on a three-bit quantum error correcting code carried out on a three-qubit nuclear magnetic resonance (NMR) quantum information processor. Utilizing both engineered and natural noise, the degree of correlations present in the noise affecting a two-qubit subsystem was determined. We measured a correlation factor of c=0.5+/-0.2 using the error correction pr…
A protocol for non-destructive descrimination of arbitrary set of orthogonal quantum states was proposed by V. S. Manu et al., using an algorithm based on quantum phase estimation. IBM Corporation has released a superconductivity based 5-qubit (5-qubit transmon bowtie chip 3 and IBM 5-qubit real processor) quantum computer named Quantum Experience and placed it on cloud. In this paper we take advantage of the online availability of those real quantum processors(ibmqx2 amd ibmqx4) and carry out the above protocol that has experimentally demonstrated earlier using NMR quantum processor. Here, we…
Being able to quantify the level of coherent control in a proposed device implementing a quantum information processor (QIP) is an important task for both comparing different devices and assessing a device's prospects with regards to achieving fault-tolerant quantum control. We implement in a liquid-state nuclear magnetic resonance QIP the randomized benchmarking protocol presented by Knill et al (PRA 77: 012307 (2008)). We report an error per randomized $\fracπ{2}$ pulse of $1.3 \pm 0.1 \times 10^{-4}$ with a single qubit QIP and show an experimentally relevant error model where the randomize…
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical simulations indicate that the running time grows only quadratically with the number of qubits.
Recently, there are more and more organizations offering quantum-cloud services, where any client can access a quantum computer remotely through the internet. In the near future, these cloud servers may claim to offer quantum computing power out of reach of classical devices. An important task is to make sure that there is a real quantum computer running, instead of a simulation by a classical device. Here we explore the applicability of a cryptographic verification scheme that avoids the need of implementing a full quantum algorithm or requiring the clients to communicate with quantum resourc…
