Related papers: Higher-order interactions in quantum optomechanics…
Unlike one-photon (first order) intensity correlation, two-photon (second order) intensity correlation is known to be impossible to achieve by any classical means. Over the last several decades, such quantum features have been intensively…
Quantum algorithms manipulate the amplitudes of quantum states to find solutions to computational problems. In this work, we present a framework for applying a general class of non-linear functions to the amplitudes of quantum states, with…
We present an efficient quantum algorithm to simulate nonlinear differential equations with polynomial vector fields of arbitrary degree on quantum platforms. Models of physical systems that are governed by ordinary differential equations…
Knill, Laflamme, and Milburn [Nature 409, 46 (2001)] have shown that quantum logic operations can be performed using linear optical elements and additional ancilla photons. Their approach is probabilistic in the sense that the logic devices…
While quantum computing provides an exponential advantage in solving linear differential equations, there are relatively few quantum algorithms for solving nonlinear differential equations. In our work, based on the homotopy perturbation…
Quantum theory permits interference between indistinguishable paths but, at the same time, restricts its order. Single-particle interference, for instance, is limited to the second order, that is, to pairs of single-particle paths. To date,…
The Quantum Approximate Optimisation Algorithm is a $p$ layer, time-variable split operator method executed on a quantum processor and driven to convergence by classical outer loop optimisation. The classical co-processor varies individual…
We study arbitrary order symmetry operators for the linear Schr\"odinger equations with arbitrary number of spatial variables. We deduce determining equations for coefficient functions of such operators and consider in detail some cases…
In the field of quantum computing, combinatorial optimization problems are typically addressed using QUBO (Quadratic Unconstrained Binary Optimization) solvers. However, these solvers are often insufficient for tackling higher-order…
We model optomechanical systems as linear optical amplifiers. This provides a unified treatment of diverse optomechanical phenomena. We emphasize, in particular, the relationship between ponderomotive squeezing and optomechanically induced…
An observer-based Hamiltonian identification algorithm for quantum systems is proposed. For the 2-level case an exponential convergence result based on averaging arguments and some relevant transformations is provided. The convergence for…
Coupling light to ensembles of strongly interacting particles has emerged as a promising route toward achieving few photon nonlinearities. One specific way to implement this kind of nonlinearity is to interface light with highly excited…
We propose a quantum algorithm to tackle the quadratic nonlinearity in the Lattice Boltzmann (LB) collision operator. The key idea is to build the quantum gates based on the particle distribution functions (PDF) within the coherence time…
We describe applications of two-dimensional subwavelength quantum emitter arrays as efficient optical elements in the linear regime. For normally incident light, the cooperative optical response, stemming from emitter-emitter dipole…
We address the experimental determination of entanglement for systems made of a pair of polarization qubits. We exploit quantum estimation theory to derive optimal estimators, which are then implemented to achieve ultimate bound to…
We introduce a quantum linear system solving algorithm based on the Kaczmarz method, a widely used workhorse for large linear systems and least-squares problems that updates the solution by enforcing one equation at a time. Its simplicity…
We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. The algorithm can be seen as an analogue of quantum annealing under the restriction of a product state space, where…
We use the stochastic quantization method to study systems with complex valued path integral weights. We assume a Langevin equation with a memory kernel and Einstein's relations with colored noise. The equilibrium solution of this…
Factorization of quantum mechanical Hamiltonians has been a useful technique for some time. This procedure has been given an elegant description by supersymmetric quantum mechanics, and the subject has become well-developed. We demonstrate…
In this paper we describe a quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials. The algorithm is nondeterministic and its expected resource requirements are polylogarithmic in…