Related papers: Feynman's Entangled Paths to Optimized Circuit Des…
We address the problem of discriminating with minimal error probability two given quantum operations. We show that the use of entangled input states generally improves the discrimination. For Pauli channels we provide a complete comparison…
The Feynman path integral has revolutionized modern approaches to quantum physics. Although the path integral formalism has proven very successful and spawned several approximation schemes, the direct evaluation of real-time path integrals…
Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the…
We explore the role of entanglement in adiabatic quantum optimization by performing approximate simulations of the real-time evolution of a quantum system while limiting the amount of entanglement. To classically simulate the time evolution…
This paper introduces the concept of exhaustively parametrised, feasibility-respecting quantum circuits for constrained combinatorial optimisation problems. Such circuits can reach, given the right parameter values, every feasible solution…
We study an ancient problem that in a static or dynamical system, sought an optimal path, which the context always means within an extremal condition. In fact, through those discussions about this theme, we established a universal essential…
Current experimental quantum computing devices are limited by noise, mainly originating from entangling gates. If an efficient gate sequence for an operation is unknown, one often employs layered parameterized quantum circuits, especially…
Long-range entanglement distribution in a quantum network relies on entanglement swapping at intermediate nodes along a network path to connect short-range entangled states established over the network edges. The end-to-end entanglement of…
The path integral approach to the quantization of one degree-of-freedom Newtonian particles is considered within the discrete time-slicing approach, as in Feynman's original development. In the time-slicing approximation the quantum…
Preparation of a non-classically correlated state is the first step of any quantum-enhanced interferometric protocol. An efficient method is the one-axis twisting, which entangles a collection of initially uncorrelated particles by means of…
Many quantum algorithms seek to output a specific bitstring solving the problem of interest--or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit…
Path finding is a well-studied problem in AI, which is often framed as graph search. Any-angle path finding is a technique that augments the initial graph with additional edges to build shorter paths to the goal. Indeed, optimal algorithms…
Quantum information processing protocols are efficiently implemented on spin-$\frac{1}{2}$ networks. A quantum communication protocol generally involves a certain number of parties having local access to a subset of a larger system, whose…
Entanglement with single-particle states is advantageous in quantum technology because of their ability to encode and process information more securely than their multi-particle analogs. Threeway and nonlocal two-way entangled…
Feynman's path integral approach is to sum over all possible spatio-temporal paths to reproduce the quantum wave function and the corresponding time evolution, which has enormous potential to reveal quantum processes in classical view.…
We address the use of entanglement to improve the precision of generalized quantum interferometry, i.e. of binary measurements aimed to determine whether or not a perturbation has been applied by a given device. For the most relevant…
Path integrals are a central tool when it comes to describing quantum or thermal fluctuations of particles or fields. Their success dates back to Feynman who showed how to use them within the framework of quantum mechanics. Since then, path…
This article explores search strategies for the design of parameterized quantum circuits. We propose several optimization approaches including random search plus survival of the fittest, reinforcement learning both with classical and hybrid…
As quantum technology advances, the efficient design of quantum circuits has become an important area of research. This paper provides an introduction to the MCT quantum circuit design problem for reversible Boolean functions with the…
We present a novel methodology for convex optimization algorithm design using ideas from electric RLC circuits. Given an optimization problem, the first stage of the methodology is to design an appropriate electric circuit whose…