Related papers: Optical analogy to quantum computation based on cl…
We develop a framework for simulating measure-preserving, ergodic dynamical systems on a quantum computer. Our approach provides a new operator-theoretic representation of classical dynamics by combining ergodic theory with quantum…
As simulations of quantum systems cross the limits of classical computability, both quantum and classical approaches become hard to verify. Scaling predictions are therefore based on local structure and asymptotic assumptions, typically…
We address the problem of implementing bottleneck layers from classical pre-trained neural networks on a quantum computer, with the goal of exploring intrinsically quantum ansatz for representing large linear layers within hybrid…
The study of tensor network theory is an important field and promises a wide range of experimental and quantum information theoretical applications. Matrix product state is the most well-known example of tensor network states, which…
Quantum entanglement is a crucial resource for a wide variety of quantum technologies. However, the current state-of-art methods to generate quantum entanglement in optomechanical systems are not as efficient as all-optical methods…
Quantum information processing provides remarkable advantages over its classical counterpart. Quantum optical systems are proved to be sufficient for realizing general quantum tasks, which however often rely on single photon sources. In…
We propose a novel interferometer by using optical transverse modes in multimode waveguide that can beat the standard quantum limit. In the scheme, the classical simulation of $N$-partical quantum entangled states is generated by using $N$…
The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…
We show how phase-space simulations of Gaussian quantum states in a photonic network permit verification of measurable correlations of Gaussian boson sampling (GBS) quantum computers. Our results agree with experiments for up to 100-th…
The von Neumann trace form of quantum statistical mechanics is transformed to an integral over classical phase space. Formally exact expressions for the resultant position-momentum commutation function are given. A loop expansion for wave…
Simulating quantum algorithms on classical computers is challenging when the system size, i.e., the number of qubits used in the quantum algorithm, is moderately large. However, some quantum algorithms and the corresponding quantum circuits…
We propose a methodology to emulate quantum phenomena arising from any non-classical quantum state using only a finite set of mixtures of coherent states. This allows us to successfully reproduce well-known quantum effects using resources…
We introduce a symbolic operator framework for simulating quantum photonic systems that works directly with the canonical commutation relations and the Weyl algebra. Unlike existing Fock-space or Gaussian simulators, our method treats…
Evaluating the entanglement spectrum is essential for characterizing exotic quantum phases such as quantum criticality and topological order. However, for large quantum many-body systems, this task is hindered by the exponential measurement…
We translate the quantum teleportation protocol into a sequence of coherent operations involving three degrees of freedom of a classical laser beam. The protocol, which we demonstrate experimentally, transfers the polarisation state of the…
If classical algorithms have been successful in reproducing the estimation of expectation values of observables of some quantum circuits using off-the-shelf computing resources, matching the performance of the most advanced quantum devices…
We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…
Understanding the capabilities of classical simulation methods is key to identifying where quantum computers are advantageous. Not only does this ensure that quantum computers are used only where necessary, but also one can potentially…
We propose the simulation of quantum-optical systems in the ultrastrong-coupling regime using a variational quantum algorithm. More precisely, we introduce a short-depth variational form to prepare the groundstate of the multimode Dicke…
We detail techniques to optimise high-level classical simulations of Shor's quantum factoring algorithm. Chief among these is to examine the entangling properties of the circuit and to effectively map it across the one-dimensional structure…