Related papers: Quantum simulation of the integer factorization pr…
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…
Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…
Quantum chemistry simulations on a quantum computer suffer from the overhead needed for encoding the fermionic problem in a bosonic system of qubits. By exploiting the block diagonality of a fermionic Hamiltonian, we show that the number of…
Is is shown here that the "simple test of quantumness for a single system" of arXiv:0704.1962 (for a recent experimental realization see arXiv:0804.1646) has exactly the same relation to the discussion of to the problem of describing the…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
We show that a Young's N slit interferometer can be used to factor the integer N. The device could factor four- or five-digit numbers in a practical fashion. This work shows how number theory may arise in physical problems, and may provide…
This paper presents a hybrid quantum-classical approach to prime factorization. The proposed algorithm is based on the Variational Quantum Eigensolver (VQE), which employs a classical optimizer to find the ground state of a given…
Integer factorization is a significant problem, with implications for the security of widely-used cryptographic schemes. No efficient classical algorithm for polynomial-time integer factorization has been found despite extensive research.…
By repeated trials, one can determine the fairness of a classical coin with a confidence which grows with the number of trials. A quantum coin can be in a superposition of heads and tails and its state is most generally a density matrix.…
We propose a Bell measurement scheme by employing a logical qubit in Greenberger-Horne-Zeilinger (GHZ) entanglement with an arbitrary number of photons. Remarkably, the success probability of the Bell measurement as well as teleportation of…
In this paper we describe a deep learning--based probabilistic algorithm for integer factorisation. We use Lawrence's extension of Fermat's factorisation algorithm to reduce the integer factorisation problem to a binary classification…
Quantum simulation provides quantum systems under study with analogous controllable quantum systems and has wide applications from condensed-matter physics to high energy physics and to cosmology. The quantum system of a homogeneous and…
The procedure for simulating the nuclear magnetic resonance spectrum linked to the spin system of a molecule for a certain nucleus entails diagonalizing the associated Hamiltonian matrix. As the dimensions of said matrix grow exponentially…
The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons, which are otherwise difficult to…
Mehring et al. have recently described an elegant nuclear magnetic resonance (NMR) experiment implementing an algorithm to factor numbers based on the properties of Gauss sums. Similar experiments have also been described by Mahesh et al.…
The first application of a quantum algorithm to Feynman loop integrals is reviewed. The connection between quantum computing and perturbative quantum field theory is feasible due to fact that the two on-shell states of a Feynman propagator…
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to…
We provide numerical evidence that the quantum Fourier transform can be efficiently represented in a matrix product operator with a size growing relatively slowly with the number of qubits. Additionally, we numerically show that the tensors…
Numerical stochastic integration is a powerful tool for the investigation of quantum dynamics in interacting many body systems. As with all numerical integration of differential equations, the initial conditions of the system being…
Exploiting quantum properties to outperform classical ways of information-processing is an outstanding goal of modern physics. A promising route is quantum simulation, which aims at implementing relevant and computationally hard problems in…