相关论文: Tailoring Many-Body Interactions to Solve Hard Com…

Three algorithms are presented that determine the existence of satisfying assignments for 3SAT Boolean satisfiability expressions. One algorithm is presented for determining an instance of a satisfying assignment, where such exists. The…

Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…

A quantum theory of feedback of bosonic many-atom systems is formulated. The feedback-induced many-atom correlations are treated by use of a parameterized correlation function, for which closed equations of motion are derived. Therefrom the…

We propose a quantum algorithm for solving physical problems represented by the lattice Boltzmann formulation. Specifically, we deal with the case of a single phase, incompressible fluid obeying the Bhatnagar-Gross-Krook model. We use the…

Owing to their long-lifetimes at cryogenic temperatures, mechanical oscillators are recognized as an attractive resource for quantum information science and as a testbed for fundamental physics. Key to these applications is the ability to…

The pairwise quantum correlations in a tripartite optomechanical system comprising a mechanical mode and two optical modes are analyzed. The Simon criterion is used as a witness of the separability. Whereas, the Gaussian discord is employed…

Modeling composite systems of spins or electrons coupled to bosonic modes is of significant interest for many fields of applied quantum physics and chemistry. A quantum simulation can allow for the solution of quantum problems beyond…

We construct a set of instances of 3SAT which are not solved efficiently using the simplest quantum adiabatic algorithm. These instances are obtained by picking random clauses all consistent with two disparate planted solutions and then…

We have identified a class of many body problems with analytic solution beyond the mean-field approximation. This is the case where each body can be considered as an element of an assembly of interacting particles that are translationally…

Classical simulation of quantum systems plays an important role in the study of many-body phenomena and in the benchmarking and verification of quantum technologies. Exact simulation is often limited to small systems because the dimension…

Quantum computing uses the physical principles of very small systems to develop computing platforms which can solve problems that are intractable on conventional supercomputers. There are challenges not only in building the required…

We present two approaches capable of describing the dynamics of an interacting many body system on a lattice coupled globally to a dissipative bosonic mode. Physical realizations are for example ultracold atom gases in optical lattice…

This work solves 3SAT, a classical NP-complete problem, on a CMOS-based Ising hardware chip with all-to-all connectivity. The paper addresses practical issues in going from algorithms to hardware. It considers several degrees of freedom in…

We present an approach to interacting quantum many-body systems based on the notion of quantum groups, also known as $q$-deformed Lie algebras. In particular, we show that if the symmetry of a free quantum particle corresponds to a Lie…

The preparation of highly entangled many-body systems is one of the central challenges of both basic and applied science. The complexity of interparticle interaction and environment coupling increases rapidly with the number of…

The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT solving, especially where sampling from the space of all…

We consider a classical and superadiabatic version of an iterative quantum adiabatic algorithm to solve combinatorial optimization problems. This algorithm is deterministic because it is based on purely classical dynamics, that is, it does…

Mathematical models of quantum computers such as a multidimensional quantum Turing machine and quantum circuits are described and its relations with lattice spin models are discussed. One of the main open problems one has to solve if one…

A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…

We briefly summarize the most relevant steps in the search of rigorous results about the properties of quantum systems made of three bosons interacting with zero-range forces. We also describe recent attempts to solve the unboundedness…