Related papers: Quantum simulation of the integer factorization pr…
Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…
We show that violation of genuine multipartite Bell inequalities can be obtained with sampled, probabilistic phase space methods. These genuine Bell violations cannot be replicated if any part of the system is described by a local hidden…
The entangled quantum states play a key role in quantum information. The association of the quantum state vector with each individual physical system in an attributive way is a source of many false paradoxes and inconsistencies. The…
Many-particle confinement (localization) is studied for a 1D system of spinless fermions with nearest-neighbor hopping and interaction, or equivalently, for an anisotropic Heisenberg spin-1/2 chain. This system is frequently used to model…
We discuss the use of quantum simulation to study an $N$ flavor theory of interacting relativistic fermions in(1+1) dimensions on NISQ era machines. The case of two flavors is particularly interesting as it can be mapped to the Hubbard…
We formulate the integer factorization problem via a formulation of the searching problem for the ground state of a statistical mechanical Hamiltonian. The first passage time required to find a correct divisor of a composite number…
We consider the realization of a quantum computer in a chain of nuclear spins coupled by an Ising interaction. Quantum algorithms can be performed with the help of appropriate radio-frequency pulses. In addition to the standard…
An electron inside liquid helium forms a bubble of 17 \AA in radius. In an external magnetic field, the two-level system of a spin 1/2 electron is ideal for the implementation of a qubit for quantum computing. The electron spin is well…
We demonstrate a complete, probabilistic quantum dynamical simulation of the standard nonlinear Hamiltonian of optomechanics, including decoherence at finite temperatures. Robust entanglement of an optical pulse with the oscillator is…
This article focuses on the development of scalable and quantum bit-efficient algorithms for computing power functions of random quantum states. Two algorithms, based on Hadamard testing and Gate Set Tomography, are proposed. We provide a…
The random matrix ensembles are applied to the quantum statistical two-dimensional systems of electrons. The quantum systems are studied using the finite dimensional real, complex and quaternion Hilbert spaces of the eigenfunctions. The…
Shor's factoring algorithm illustrates the potential power of quantum computation. Here we present and numerically investigate a proposal for a compiled version of such an algorithm based on a quantum-wire network exploiting the…
There has been a concerted effort to identify problems computable with quantum technology which are intractable with classical technology or require far fewer resources to compute. Recently, randomness processing in a Bernoulli factory has…
Quantum entanglement plays an important role in quantum information processes, such as quantum computation and quantum communication. Experiments in laboratories are unquestionably crucial to increase our understanding of quantum systems…
Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two…
We present a setup for quantum cryptography based on photon pairs in energy-time Bell states and show its feasability in a laboratory experiment. Our scheme combines the advantages of using photon pairs instead of faint laser pulses and the…
We show how a number of NP-complete as well as NP-hard problems can be reduced to the Sturm-Liouville eigenvalue problem in the quantum setting with queries. We consider power queries which are derived from the propagator of a system…
A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their…
We propose the implementation of a switch of particle statistics with an embedding quantum simulator. By encoding both Bose-Einstein and Fermi-Dirac statistics into an enlarged Hilbert space, the statistics of quantum particles may be…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…