Related papers: Quantum systems simulatability through classical n…
Quantum phenomena of interest in connection with applications to computation and communication almost always involve generating specific transfers between eigenstates, and their linear superpositions. For some quantum systems, such as spin…
In this paper, we develop a new classical simulation of quantum bit (qubit) by use of analog components in order to be able to simulate the quantum properties such as the superposition of states. As part of this new approach, we have also…
We propose a classical-quantum hybrid algorithm for machine learning on near-term quantum processors, which we call quantum circuit learning. A quantum circuit driven by our framework learns a given task by tuning parameters implemented on…
The use of classical computers to simulate quantum computing has been successful in aiding the study of quantum algorithms and circuits that are too complex to examine analytically. Current implementations of quantum computing simulators…
It is difficult to calculate the energy levels and eigenstates of a large physical system on a classical computer because of the exponentially growing size of the Hilbert space. In this work, we experimentally demonstrate a quantum…
We identify a broad class of physical processes in an optical quantum circuit that can be efficiently simulated on a classical computer: this class includes unitary transformations, amplification, noise, and measurements. This…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…
Consistent dynamics which couples classical and quantum degrees of freedom exists, provided it is stochastic. This dynamics is linear in the hybrid state, completely positive and trace preserving. One application of this is to study the…
We present a pedagogical work-in-progress. This textbook aims to introduce Hilbert space representations for quantum and classical dynamics, outlining the mathematical foundations, practical guidance, and Python implementation of dynamical…
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and…
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…
Quantum computation and quantum simulation require a versatile gate set to optimize circuit compilation for practical applications. However, existing platforms are often limited to specific gate types or rely on parametric couplers to…
We present a quantum-classical hybrid algorithm that simulates electronic structures of periodic systems such as ground states and quasiparticle band structures. By extending the unitary coupled cluster (UCC) theory to describe crystals in…
Classical dynamics is formulated as a Hamiltonian flow on phase space, while quantum mechanics is formulated as a unitary dynamics in Hilbert space. These different formulations have made it difficult to directly compare quantum and…
In this paper, we propose the concept of symplectic computers, which have the potential to be more powerful than quantum computers. Unlike quantum computing, which consists of a sequence of unitary transformations (gates) and projectors…
We discuss the classical and quantum mechanical evolution of systems described by a Hamiltonian that is a function of a solvable one, both classically and quantum mechanically. The case in which the solvable Hamiltonian corresponds to the…
Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering,…
The method of group quantization described in the preceeding paper I is extended so that it becomes applicable to some parametrized systems that do not admit a global transversal surface. A simple completely solvable toy system is studied…
In this note we describe a simple and intriguing observation: the quantum Fourier transform (QFT) over $Z_q$, which is considered the most ``quantum'' part of Shor's algorithm, can in fact be simulated efficiently by classical computers.…
Heisenberg spin chains can act as quantum wires transferring quantum states either perfectly or with high fidelity. Gaussian packets of excitations passing through dual rails can encode the two states of a logical qubit, depending on which…