Related papers: Doubling the size of quantum simulators by entangl…
We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted.…
Quantum entanglement is an essential feature of many-body systems that impacts both quantum information processing and fundamental physics. The growth of entanglement is a major challenge for classical simulation methods. In this work, we…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum computers have the potential to solve certain interesting problems significantly faster than classical computers. To exploit the power of a quantum computation it is necessary to perform inter-qubit operations and generate entangled…
This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have…
We address the question of how a quantum computer can be used to simulate experiments on quantum systems in thermal equilibrium. We present two approaches for the preparation of the equilibrium state on a quantum computer. For both…
Quantum systems have entered a competitive regime where classical computers must make approximations to represent highly entangled quantum states. However, in this beyond-classically-exact regime, fidelity comparisons between quantum and…
We present an approach to simulating quantum computation based on a classical model that directly imitates discrete quantum systems. Qubits are represented as harmonic functions in a 2D vector space. Multiplication of qubit representations…
Distributed quantum computation is a practical method for large-scale quantum computation on quantum processors with limited size. It can be realized by direct quantum channels in flying qubits. Moreover, the pre-established quantum…
Quantum computing is greatly advanced in recent years and is expected to transform the computation paradigm in the near future. Quantum circuit simulation plays a key role in the toolchain for the development of quantum hardware and…
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly…
Simulating physical systems with variational quantum algorithms is a well-studied approach, but it is challenging to implement in current devices due to demands in qubit number and circuit depth. We show how limited knowledge of the system,…
We have found a quantum cloning machine that optimally duplicates the entanglement of a pair of $d$-dimensional quantum systems. It maximizes the entanglement of formation contained in the two copies of any maximally-entangled input state,…
Classical systems can be entangled. Entanglement is defined by coincidence correlations. Quantum entanglement experiments can be mimicked by a mechanical system with a single conserved variable and 77.8% conditional efficiency. Experiments…
Quantum computers hold promise to enable efficient simulations of the properties of molecules and materials; however, at present they only permit ab initio calculations of a few atoms, due to a limited number of qubits. In order to harness…
The advent of hybrid computing platforms consisting of quantum processing units integrated with conventional high-performance computing brings new opportunities for algorithm design. By strategically offloading select portions of the…
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…
An effective simulation of quantum entanglement is presented using classical fields modulated with n pseudorandom phase sequences (PPSs) that constitute a n2^n-dimensional Hilbert space with a tensor product structure. Applications to…