相关论文: A C++ library using quantum trajectories to solve …
We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The…
We present an effective operator formalism for open quantum systems. Employing perturbation theory and adiabatic elimination of excited states for a weakly driven system, we derive an effective master equation which reduces the evolution to…
We model the transport of an unknown quantum state on one dimensional qubit lattices by means of a quantum cellular automata evolution. We do this by first introducing a class of discrete noisy dynamics, in the first excitation sector, in…
An adapted representation of quantum mechanics sheds new light on the relationship between quantum states and classical states. In this approach the space of quantum states splits into a product of the state space of classical mechanics and…
We suggest a hybrid quantum-classical routine for the NP-hard Electric Vehicle Fleet Charging and Allocation Problem. The original formulation is a Mixed Integer Linear Program with continuous variables and inequality constraints. To…
Quantum optimization has emerged as a promising frontier of quantum computing, providing novel numerical approaches to mathematical optimization problems. The main goal of this paper is to facilitate interdisciplinary research between the…
Quantum computing is emerging as a new computing resource that could be superior to conventional computing for certain classes of optimization problems. However, in principle, most existing approaches to quantum optimization are intended to…
Quantum state diffusion (QSD) as a tool to solve quantum-optical master equations by stochastic simulation can be made several orders of magnitude more efficient if states in Hilbert space are represented in a moving basis of excited…
We introduce a quantum extension of dynamic programming, a fundamental computational method that efficiently solves recursive problems using memory. Our innovation lies in showing how to coherently generate recursion step unitaries by using…
A number of recent studies have proposed that linear representations are appropriate for solving nonlinear dynamical systems with quantum computers, which fundamentally act linearly on a wave function in a Hilbert space. Linear…
We investigate a family of qubit-oscillator states as resources for hybrid quantum communication. They result from a mechanism of qubit-controlled displacement on the oscillator. For large displacements, we obtain analytical formulas for…
The Traveling Salesman Problem (TSP) is a classical NP-hard problem that plays a crucial role in combinatorial optimization. In this paper, we are interested in the quantum search framework for the TSP because it has robust theoretical…
Quantum computing exhibits the unique capability to natively and efficiently encode various natural phenomena, promising theoretical speedups of several orders of magnitude. However, not all computational tasks can be efficiently executed…
We study a model of quantum computation based on the continuously-parameterized yet finite-dimensional Hilbert space of a spin system. We explore the computational powers of this model by analyzing a pilot problem we refer to as the close…
Quantum stochastic master equations of jump type are formulated in a general way and connections with quantum/classical hybrid systems and quantum filtering theory are discussed. By introducing the notion of ``typical trajectory", we show…
This document is meant as a pedagogical introduction to the modern language used to talk about quantum theory, especially in the field of quantum information. It assumes that the reader has taken a first traditional course on quantum…
We propose an algebraic formulation for two distinct quantum algorithms: a quantum classification algorithm and a quantum search algorithm with a non-uniform initial distribution, both based on Clifford algebras and spinorial…
The application of quantum algorithms to classical problems is generally accompanied by significant bottlenecks when transferring data between quantum and classical states, often negating any intrinsic quantum advantage. Here we address…
Digital quantum computers promise exponential speedups in performing quantum time-evolution, providing an opportunity to simulate quantum dynamics of complex systems in physics and chemistry. However, the task of extracting desired quantum…
The cost of classical simulations of quantum many-body dynamics is often determined by the amount of entanglement in the system. In this paper, we study entanglement in stochastic quantum trajectory approaches that solve master equations…