Efficient Simulation of Loop Quantum Gravity -- A Scalable Linear-Optical Approach

• URL: http://arxiv.org/abs/2003.03414v3
• Date: Sun, 3 Jan 2021 22:59:20 GMT
• Title: Efficient Simulation of Loop Quantum Gravity -- A Scalable Linear-Optical Approach
• Authors: Lior Cohen, Anthony J. Brady, Zichang Huang, Hongguang Liu, Dongxue Qu, Jonathan P. Dowling, Muxin Han
• Abstract summary: A leading approach is Loop Quantum Gravity (LQG) We design a linear-optical simulator such that the evolution of the optical quantum gates simulates the spinfoam amplitudes of LQG. This work opens a new way to relate quantum gravity to quantum information and will expand our understanding of the theory.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian [0.0]
  We present a practical method for implementing universal quantum computation using the transverse-field Ising Hamiltonian. Our proposal is compatible with D-Wave devices, opening up possibilities for realizing large-scale gate-based quantum computers.
  arXiv  Detail & Related papers  (2024-02-29T12:47:29Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Experimental Simulation of Loop Quantum Gravity on a Photonic Chip [0.0]
  We experimentally demonstrate quantum simulations of spinfoam amplitudes of Loop Quantum Gravity (LQG) on an integrated photonics quantum processor. We show that the derived spinfoam 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.
  arXiv  Detail & Related papers  (2022-07-01T17:14:30Z)
• Recent Advances for Quantum Neural Networks in Generative Learning [98.88205308106778]
  Quantum generative learning models (QGLMs) may surpass their classical counterparts. We review the current progress of QGLMs from the perspective of machine learning. We discuss the potential applications of QGLMs in both conventional machine learning tasks and quantum physics.
  arXiv  Detail & Related papers  (2022-06-07T07:32:57Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Large scale multi-node simulations of $\mathbb{Z}_2$ gauge theory quantum circuits using Google Cloud Platform [0.0]
  We present a large scale simulation study powered by a multi-node implementation of qsim using the Google Cloud Platform. We demonstrate the use of high performance cloud computing for simulating $mathbbZ$ quantum field theories on system sizes up to 36 qubits.
  arXiv  Detail & Related papers  (2021-10-14T15:56:26Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Quantum Computing for Inflationary, Dark Energy and Dark Matter Cosmology [1.1706540832106251]
  Quantum computing is an emerging new method of computing which excels in simulating quantum systems. We show how to apply the Variational Quantum Eigensolver (VQE) and Evolution of Hamiltonian (EOH) algorithms to solve the Wheeler-DeWitt equation. We find excellent agreement with classical computing results and describe the accuracy of the different quantum algorithms.
  arXiv  Detail & Related papers  (2021-05-28T14:04:11Z)
• Quantum simulation of open quantum systems in heavy-ion collisions [0.0]
  We present a framework to simulate the dynamics of hard probes such as heavy quarks or jets in a hot, strongly-coupled quark-gluon plasma (QGP) on a quantum computer. Our work demonstrates the feasibility of simulating open quantum systems on current and near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-07T18:00:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.