Abstract Quantum simulation has shown its irreplaceable role in many fields, where it is difficult for classical computers to do much. On a four-qubit Nuclear Magnetic Resonance (NMR) quantum simulator, we experimentally simulate the spin-network states by simulating quantum spacetime tetrahedra. The fidelities of our experimentally prepared quantum tetrahedra are all above 95%. We then use the quantum tetradedra prepared by the Nuclear Magnetic Resonance to simulate a spinfoam vertex amplitude, which displays the local dynamics of quantum spacetime. By measuring the geometric properties on the corresponding quantum tetrahedra and simulating their interaction, our experiment serves as a basic module that represents the Feynman diagram vertex in the spinfoam formulation of Loop Quantum Gravity(LQG). This is an initial attempt to study LQG by quantum information processing.
Abstract Quantum simulation has shown its irreplaceable role in many fields, where it is difficult for classical computers to do much. On a four-qubit Nuclear Magnetic Resonance (NMR) quantum simulator, we experimentally simulate the spin-network states by simulating quantum spacetime tetrahedra. The fidelities of our experimentally prepared quantum tetrahedra are all above 95%. We then use the quantum tetradedra prepared by the Nuclear Magnetic Resonance to simulate a spinfoam vertex amplitude, which displays the local dynamics of quantum spacetime. By measuring the geometric properties on the corresponding quantum tetrahedra and simulating their interaction, our experiment serves as a basic module that represents the Feynman diagram vertex in the spinfoam formulation of Loop Quantum Gravity(LQG). This is an initial attempt to study LQG by quantum information processing.
Loop Quantum Gravity (LQG) is one of the leading approaches to unify quantum physics and General Relativity (GR). The Hilbert space of LQG is spanned by spin-networks which describe the local geometry of quantum space-time. Simulation of LQG spin-network states and their dynamics is classically intractable and is widely believed to fall in the Bounded Quantum Polynomial (BQP) time complexity class. There have been many recent attempts to simulate these states using novel and off the shelf quantum computing technologies. In this article, we review three such efforts which utilize superconducting qubits, linear optical qubits and Nuclear Magnetic Resonance (NMR) qubits respectively. The articles chosen for this review represent state of the art in quantum simulations of LQG.
Abstract The unification of general relativity and quantum theory is one of the fascinating problems of modern physics. One leading solution is Loop Quantum Gravity (LQG). Simulating LQG may be important for providing predictions which can then be tested experimentally. However, such complex quantum simulations cannot run efficiently on classical computers, and quantum computers or simulators are needed. Here, we experimentally demonstrate quantum simulations of spinfoam amplitudes of LQG on an integrated photonics quantum processor. We simulate a basic transition of LQG and show that the derived spinfoam vertex amplitude falls within 4% error with respect to the theoretical prediction, despite experimental imperfections. We also discuss how to generalize the simulation for more complex transitions, in realistic experimental conditions, which will eventually lead to a quantum advantage demonstration as well as expand the toolbox to investigate LQG.
The problem of simulating complex quantum processes on classical computers gave rise to the field of quantum simulations. Quantum simulators solve problems, such as Boson sampling, where classical counterparts fail. In another field of physics, the unification of general relativity and quantum theory is one of the greatest challenges of our time. One leading approach is Loop Quantum Gravity (LQG). Here, we connect these two fields and design a linear-optical simulator such that the evolution of the optical quantum gates simulates the spinfoam amplitudes of LQG. It has been shown that computing transition amplitudes in simple quantum field theories falls into the class BQP -- which strongly suggests that computing transition amplitudes of LQG are classically intractable. Therefore, these amplitudes are efficiently computable with universal quantum computers which are, alas, possibly decades away. We propose here an alternative special-purpose linear-optical quantum computer, which can be implemented using current technologies. This machine is capable of efficiently computing these quantities. This work opens a new way to relate quantum gravity to quantum information and will expand our understanding of the theory.
The problem of simulating complex quantum processes on classical computers gave rise to the field of quantum simulations. Quantum simulators solve problems, such as boson sampling, where classical counterparts fail. In another field of physics, the unification of general relativity and quantum theory is one of the greatest challenges of our time. One leading approach is loop quantum gravity (LQG). Here, we connect these two fields and design a linear-optical simulator such that the evolution of the optical quantum gates simulates the spin-foam amplitudes of LQG. It has been shown that computing transition amplitudes in simple quantum field theories falls into the bounded-error quantum polynomial time class, which strongly suggests that computing transition amplitudes of LQG are classically intractable. Therefore, these amplitudes are efficiently computable with universal quantum computers, which are, alas, possibly decades away. We propose here an alternative special-purpose linear-optical quantum computer that can be implemented using current technologies. This machine is capable of efficiently computing these quantities. This work opens a new way to relate quantum gravity to quantum information and will expand our understanding of the theory.
In loop quantum gravity approach to Planck scale physics, quantum geometry is represented by superposition of the so-called spin network states. In the recent literature, a class of spin networks promising from the perspective of quantum simulations of quantum gravitational systems has been studied. In this case, the spin network states are represented by graphs with four-valent nodes, and two dimensional intertwiner Hilbert spaces (qubits of space) attached to them. In this article, construction of quantum circuits for a general intertwiner qubit is presented. The obtained circuits are simulated on 5-qubit (Yorktown) and 15-qubit (Melbourne) IBM superconducting quantum computers, giving satisfactory fidelities. The circuits provide building blocks for quantum simulations of complex spin networks in the future. Furthermore, a class of maximally entangled states of spin networks is introduced. As an example of application, attempts to determine transition amplitudes for a monopole and a dipole spin network with the use of superconducting quantum processor are made.
Quantum simulations, where controllable quantum systems are used to simulate other quantum systems, originally proposed by Richard Feynman, are one of the most remarkable applications of quantum information science. Compared to computation, quantum simulations require much less number of qubits for the m to be practical. In the work described in this thesis, we have performed a few quantum simulations of small quantum systems using Nuclear Magnetic Resonance(NMR) techniques. These simulations have been used to experimentally demonstrate the underlying interesting quantum protocols. All the experiments presented have been carried out using liquid-state or liquid crystal NMR. Numerical pulse optimization techniques have been utilized in some of the experiments, to achieve better control over the spin systems.
The first chapter contains “Introduction” to quantum information processing, NMR, and numerical pulse optimization techniques. In chapter 2, we describe quantum simulation of a 3-spin Heisenberg-XY spin chain having only nearest neighbour interactions. Recently, spin chains having pre-engineered short-range interactions have been proposed to efficiently transfer quantum information between different parts of a quantum information processor. Other important proposals involving these spin chains include generating entangled states and universal quantum computation. However, such engineered interactions do not occur naturally in any system. In such a scenario, the experimental viability of these proposals can be tested by simulating the spin chains in other controllable quantum systems. In this work, we first theoretically study the time evolution of bipartite and tripartite entanglement measures for a 3-spin open ended XY spin chain. Then, by simulating the XY interactions in a 3-spin nuclear spin system, we experimentally generate, (i)a bipartite maximally(pseudo-)entangled state(Bell state) between end qubits, and(ii) multipartite(pseudo-)entangled states(Wand GHZ states),starting from separable pseudo-pure states. Bell state has been generated by using only the natural unitary evolution of the XY spin chain. W-state and GHZ-state have been generated by applying a single-qubit rotation to the second qubit, and a global rotation of all the three qubits respectively after the unitary evolution of the spin chain.
In chapter 3, we simulate a 3-spin quantum transverse Ising spin system in a triangular configuration, and show that multipartite quantum correlations can be used to distinguish between the frustrated and non-frustrated regimes in the ground state of this spin system. The ground state of the spin system has been prepared by using adiabatic state preparation method. Gradient ascent pulse engineering technique has been utilized to efficiently realize the adiabatic evolution of the spin system. To analyse the experimental ground state of the system, we employ two different multipartite quantum correlation measures, generated from monogamy studies of bipartite quantum correlations.
Chapter 4 contains a digital…