From simulatability to universality of continuous-variable quantum computers

• URL: http://arxiv.org/abs/2505.21618v1
• Date: Tue, 27 May 2025 18:00:03 GMT
• Title: From simulatability to universality of continuous-variable quantum computers
• Authors: Cameron Calcluth,
• Abstract summary: thesis investigates the boundary of which circuits are classically simulatable.<n> circuits initiated with highly Wigner-negativeesman-Kitaev-Preskill states can be simulated in time space.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: (Abridged.) Quantum computers promise to solve some problems exponentially faster than traditional computers, but we still do not fully understand why this is the case. While the most studied model of quantum computation uses qubits, which are the quantum equivalent of a classical bit, an alternative method for building quantum computers is gaining traction. Continuous-variable devices, with their infinite range of measurement outcomes, use systems such as electromagnetic fields. Given this infinite-dimensional structure, combined with the complexities of quantum physics, we are left with a natural question: when are continuous-variable quantum computers more powerful than classical devices? This thesis investigates this question by exploring the boundary of which circuits are classically simulatable and which unlock a quantum advantage over classical computers. A series of proofs are presented demonstrating the efficient simulatability of progressively more complex circuits, even those with high amounts of Wigner negativity. Specifically, circuits initiated with highly Wigner-negative Gottesman-Kitaev-Preskill states, which form a grid-like structure in phase space, can be simulated in polynomial time.

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)
• Benefits of non-adiabatic quantum control in quantum computation through spin qubit systems [0.0]
  controllable quantum systems can be reliable building blocks for Quantum computation. In the future, we hope to see a full fledged operationally stable quantum computer.
  arXiv  Detail & Related papers  (2024-03-17T17:48:51Z)
• Parallelizing quantum simulation with decision diagrams [2.5999037208435705]
  Classical computers face a critical obstacle in simulating quantum algorithms. Quantum states reside in a Hilbert space whose size grows exponentially to the number of subsystems, i.e., qubits. This work explores several strategies for parallelizing decision diagram operations, specifically for quantum simulations.
  arXiv  Detail & Related papers  (2023-12-04T02:00:24Z)
• 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)
• Classical Chaos in Quantum Computers [39.58317527488534]
  Current-day quantum processors, comprising 50-100 qubits, operate outside the range of quantum simulation on classical computers. We demonstrate that the simulation of classical limits can be a potent diagnostic tool potentially mitigating this problem. We find that classical and quantum simulations lead to similar stability metrics in systems with $mathcalO$ transmons.
  arXiv  Detail & Related papers  (2023-04-27T18:00:04Z)
• Quantum computing with and for many-body physics [0.0]
  Quantum many-body systems are used to build quantum processors. Current and future quantum processors can be used to describe large many-body systems of fermions such as electrons and nucleons.
  arXiv  Detail & Related papers  (2023-03-08T19:34:55Z)
• 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)
• 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)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Towards Cosmological Simulations of Dark Matter on Quantum Computers [0.0]
  Quantum computers can perform some calculations exponentially faster than classical computers. Quantum circuits act linearly on quantum states, so nonlinearities (e.g. self-gravity in cosmological simulations) pose a significant challenge. Here we outline one potential approach to overcome this challenge and solve the (nonlinear) Schrodinger-Poisson equations for the evolution of self-gravitating dark matter.
  arXiv  Detail & Related papers  (2021-01-14T19:00:06Z)
• Bit-Slicing the Hilbert Space: Scaling Up Accurate Quantum Circuit Simulation to a New Level [10.765480856320018]
  We enhance quantum circuit simulation in two dimensions: accuracy and scalability. Experimental results demonstrate that our method can be superior to the state-of-the-art for various quantum circuits.
  arXiv  Detail & Related papers  (2020-07-18T01:26:40Z)

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.