Related papers: The coherent Ising machine with quantum feedback: …

In addition to the well-known Landauer-Buttiker scattering theory and the nonequilibrium Green's function technique for mesoscopic transports, an alternative (and very useful) scheme is quantum master equation approach. In this article, we…

An interesting problem in the field of quantum error correction involves finding a physical system that hosts a ``passively protected quantum memory,'' defined as an encoded qubit coupled to an environment that naturally wants to correct…

Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines…

A method of exactly solving the master equation is presented in this letter. The explicit form of the solution is determined by the time evolution of a composite system including an auxiliary system and the open system in question. The…

Capturing the dynamics of quantum many-body systems under time-dependent driving protocols is a central challenge for numerical simulations. Existing methods such as tensor networks and time-dependent neural quantum states, however, must be…

A quantum simulator is a well controlled quantum system that can simulate the behavior of another quantum system which may require exponentially large classical computing resources to understand otherwise. In the 1980s, Feynman proposed the…

The Path Integral Monte Carlo simulated Quantum Annealing algorithm is applied to the optimization of a large hard instance of the Random 3-SAT Problem (N=10000). The dynamical behavior of the quantum and the classical annealing are…

We propose a new method for pure-state and subspace preparation in quantum systems, which employs the output of a continuous measurement process and switching dissipative control to improve convergence speed, as well as robustness with…

Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard quantum computation. Nevertheless, it has been shown that…

We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering and satisfiability. In each case,…

Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…

This paper discusses fully coherent quantum feedback control, in which the sensors, controller, and actuators are quantum systems and interact coherently with the system to be controlled: as a result, the entire feedback loop is coherent.…

Constructing realistic digital twins for applications such as training autonomous driving models requires the efficient allocation of real-world data, yet data sovereignty regulations present a major challenge. To address this, we tackle…

A simple channel state information (CSI) feedback scheme is proposed for interference alignment (IA) over the K-user constant Multiple-Input-Multiple-Output Interference Channel (MIMO IC). The proposed technique relies on the identification…

Quantum simulators, machines that can replicate the dynamics of quantum systems, are being built as useful devices and are seen as a stepping stone to universal quantum computers. A key difference between the two is that computers have the…

We compare the performance of quantum annealing (QA, through Schr\"odinger dynamics) and simulated annealing (SA, through a classical master equation) on the $p$-spin infinite range ferromagnetic Ising model, by slowly driving the system…

High-connectivity circuits are a major roadblock for current quantum hardware. We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders. As main technical tool, we introduce…

Quantum error correction is an essential ingredient for reliable quantum computation for theoretically provable quantum speedup. Topological color codes, one of the quantum error correction codes, have an advantage against the surface codes…

Recent years have seen significant advances in quantum/quantum-inspired technologies capable of approximately searching for the ground state of Ising spin Hamiltonians. The promise of leveraging such technologies to accelerate the solution…

Universal quantum algorithms (UQA) implemented on fault-tolerant quantum computers are expected to achieve an exponential speedup over classical counterparts. However, the deep quantum circuits makes the UQA implausible in the current era.…