Related papers: Classical simulation of non-Gaussian bosonic circu…
The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…
Simulating quantum algorithms with classical resources generally requires exponential resources. However, heuristic classical approaches are often very efficient in approximately simulating special circuit structures, for example with…
The future development of quantum technologies relies on creating and manipulating quantum systems of increasing complexity, with key applications in computation, simulation and sensing. This poses severe challenges in the efficient…
This paper proposes a new class of real-time optimization schemes to overcome system-model mismatch of uncertain processes. This work's novelty lies in integrating derivative-free optimization schemes and multi-fidelity Gaussian processes…
A novel quantum algorithm for solving the Boltzmann-Maxwell equations of the 6D collisionless plasma is proposed. The equation describes the kinetic behavior of plasma particles in electromagnetic fields and is known for the classical…
Boson sampling has been theoretically proposed and experimentally demonstrated to show quantum computational advantages. However, it still lacks the deep understanding of the practical applications of boson sampling. Here we propose that…
Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical…
Gaussian boson sampling is a model of photonic quantum computing that has attracted attention as a platform for building quantum devices capable of performing tasks that are out of reach for classical devices. There is therefore significant…
Universal quantum computers promise a dramatic speed-up over classical computers but a full-size realization remains challenging. However, intermediate quantum computational models have been proposed that are not universal, but can solve…
We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in $d \geq 2$ dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be…
In recent times, Variational Quantum Circuits (VQC) have been widely adopted to different tasks in machine learning such as Combinatorial Optimization and Supervised Learning. With the growing interest, it is pertinent to study the…
Linear optical circuits with single-photon sources offer a promising platform for quantum chemistry and machine learning. However, current applications are all based on support vector machines or gradient-free optimization methods. This…
In the era of noisy intermediate-scale quantum computers, variational quantum algorithms are promising approaches for solving optimization tasks by training parameterized quantum circuits with the aid of classical routines informed by…
Bayesian learning using Gaussian processes provides a foundational framework for making decisions in a manner that balances what is known with what could be learned by gathering data. In this dissertation, we develop techniques for…
We consider dynamically constrained Monte-Carlo dynamics and show that this leads to the generation of long ranged effective interactions. This allows us to construct a local algorithm for the simulation of charged systems without ever…
Algorithms for computing the classical Gaussian quadrature rules (Gauss--Jacobi, Gauss--Laguerre, and Gauss--Hermite) are presented, based on globally convergent fourth-order iterative methods combined with asymptotic approximations, which…
We present a new paradigm for the dynamical simulation of interacting many-boson open quantum systems. The method relies on a variational ansatz for the $n$-boson density matrix, in terms of a superposition of photon-added coherent states.…
Many computer vision and human-computer interaction applications developed in recent years need evaluating complex and continuous mathematical functions as an essential step toward proper operation. However, rigorous evaluation of this kind…
With the significant advancement in quantum computation in the past couple of decades, the exploration of machine-learning subroutines using quantum strategies has become increasingly popular. Gaussian process regression is a widely used…
Gaussian processes (GP) are Bayesian non-parametric models that are widely used for probabilistic regression. Unfortunately, it cannot scale well with large data nor perform real-time predictions due to its cubic time cost in the data size.…