Related papers: Tailoring Many-Body Interactions to Solve Hard Com…
Many difficult computational problems involve the simultaneous satisfaction of multiple constraints which are individually easy to satisfy. Such problems occur in diffractive imaging, protein folding, constrained optimization (e.g., spin…
We present a quantum solution to coordination problems that can be implemented with present technologies. It provides an alternative to existing approaches, which rely on explicit communication, prior commitment or trusted third parties.…
Extensions of average Hamiltonian theory to quantum computation permit the design of arbitrary Hamiltonians, allowing rotations throughout a large Hilbert space. In this way, the kinematics and dynamics of any quantum system may be…
The Deutsch model of quantum computation is extended to allow for thermodynamically irreversible operations by allowing the system of interest to interact with an outside reservoir. A set of irreversible logical error correction…
An ab-initio description of atomic nuclei that solves the nuclear many-body problem for realistic nuclear forces is expected to possess a high degree of predictive power. In this contribution we treat the main obstacle, namely the…
A universal algorithm for a deterministic preparation of arbitrary three--mode bosonic states is introduced. In particular, we consider preparation of entangled quantum states of a vibrational motion of an ion confined in a 3D trapping…
A common way of solving satisfiability instances with quantum methods is to transform these instances into instances of QUBO, which in itself is a potentially difficult and expensive task. State-of-the-art transformations from MAX-3SAT to…
We propose a quantum algorithm for approximately counting the number of solutions to planar 2-satisfiability (2SAT) formulas natively on neutral atom quantum computers. Our algorithm maps Boolean variables to atomic registers arranged in…
A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this…
The combination of different quantum systems may allow the exploration of the distinctive features of each system for the investigation of fundamental phenomena as well as for quantum technologies. In this work we consider a setup…
While quantum computers assume existence of state preparation process $|0\rangle$, CPT symmetry of physics says that performing such process in CPT symmetry perspective, e.g. reversing used EM impulses ($V(t)\to V(-t)$), we should get its…
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…
We present a multi-step quantum algorithm for solving the $3$-bit exact cover problem, which is one of the NP-complete problems. Unlike the brute force methods have been tried before, in this algorithm, we showed that by applying the…
We develop an approach in solving exactly the problem of three-body oscillators including general quadratic interactions in the coordinates for arbitrary masses and couplings. We introduce a unitary transformation of three independent…
We show that collective three-body interactions (3BIs), implementable with $N$ atoms loaded inside an optical cavity, offer a significant advantage for preparing complex multipartite entangled states. Firstly, they enable a speedup of order…
The Boolean constraint satisfaction problem 3-SAT is arguably the canonical NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial time, but in fact in deterministic linear time. In 2006, Bravyi proposed a physically…
We propose a polynomially bounded, in time and space, method to decide whether a given 3-SAT formula is satisfiable or not. The tools we use here are, in fact, very simple. We first decide satisfiability for a particular 3-SAT formula,…
Quantum mechanics is characterized by quantum coherence and entanglement. After having discovered how these fundamental concepts govern physical reality, scientists have been devoting intense efforts to harness them to shape future science…
The quantum many-electron problem is not just at the heart of condensed matter phenomena, but also essential for first-principles simulation of chemical phenomena. Strong correlation in chemical systems are prevalent and present a…
Entanglement lies at the heart of quantum mechanics and in recent years has been identified as an essential resource for quantum information processing and computation. Creating highly entangled multi-particle states is therefore one of the…