Related papers: Feynman's Entangled Paths to Optimized Circuit Des…
The Feynman path integral is defined over the space $\mathbb{R}^T$ of all possible paths; it has been a powerful tool to develop Quantum Mechanics. The absolute value of Feynman's integrand is not integrable, then Lebesgue integration…
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave…
The absent-minded driver's problem illustrates that probabilistic strategies can give higher pay-offs than deterministic ones. We show that there are strategies using quantum entangled states that give even higher pay-offs, both for the…
We address the question of how many maximally entangled photon pairs are needed in order to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily…
We examine a fundamental problem in quantum optics: What is the optimal pulse form to drive a two-photon-transition? We show that entangled photons in general do so more efficiently than optimal classical pulses, and provide the first…
In this PhD thesis, several aspects regarding maximal entanglement are analyzed. In the first chapter, Bell Inequalities are analyzed from an operational perspective as well as novel Bell inequalities are obtained together with their…
We optimize a quantum walk of multiple fermions following a quench in a spin chain to generate near ideal resources for quantum networking. We first prove an useful theorem mapping the correlations evolved from specific quenches to the…
Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum Networks (QNs) can help address this challenge by enabling the construction of large, robust, and more capable quantum…
We show that recent experiments in hybrid qubit-oscillator devices that measure the phase-space characteristic function of the oscillator via the qubit can be seen through the lens of functional calculus and path integrals, drawing a clear…
Reliable preparation of entanglement between distant systems is an outstanding problem in quantum information science and quantum communication. In practice, this has to be accomplished via noisy channels (such as optical fibers) that…
We provide a new paradigm for quantum simulation that is based on path integration that allows quantum speedups to be observed for problems that are more naturally expressed using the path integral formalism rather than the conventional…
We consider a suboptimal solution path algorithm for the Support Vector Machine. The solution path algorithm is an effective tool for solving a sequence of a parametrized optimization problems in machine learning. The path of the solutions…
Entangled photons are widely used in quantum technologies. Many photonic experiments generate them with probabilistic photon-pair sources that can be modeled as squeeze operators. In practice, these sources are usually treated in the…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
Quantum computers are different from binary digital electronic computers based on transistors. Common digital computing encodes the data into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum…
Quantum entanglement is a key resource for quantum technologies, including emerging ground-to-satellite quantum communication. In such a scenario, an important challenge to be overcome is to consider entanglement between two or more quantum…
We develop a strong and computationally simple entanglement criterion. The criterion is based on an elementary positive map Phi which operates on state spaces with even dimension N >= 4. It is shown that Phi detects many entangled states…
Identifying and extracting the past information relevant to the future behaviour of stochastic processes is a central task in the quantitative sciences. Quantum models offer a promising approach to this, allowing for accurate simulation of…
We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…