Related papers: Feynman's Entangled Paths to Optimized Circuit Des…
Tensor networks represent the state-of-the-art in computational methods across many disciplines, including the classical simulation of quantum many-body systems and quantum circuits. Several applications of current interest give rise to…
A systematic classification of Feynman path integrals in quantum mechanics is presented and a table of solvable path integrals is given which reflects the progress made during the last ten years or so, including, of course, the main…
Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the…
By carefully analyzing the relations between operator methods and the discretized and continuum path integral formulations of quantum-mechanical systems, we have found the correct Feynman rules for one-dimensional path integrals in curved…
I investigate the problem of optimally discriminating between two open quantum dynamical processes in a single-shot scenario, with the goal of minimizing the error probability of identification. This task involves optimising both the input…
Parameterized circuit instantiation is a common technique encountered in the generation of circuits for a large class of hybrid quantum-classical algorithms. Despite being supported by popular quantum compilation infrastructures such as IBM…
A central aspect for operating future quantum computers is quantum circuit optimization, i.e., the search for efficient realizations of quantum algorithms given the device capabilities. In recent years, powerful approaches have been…
We study the role of driving in an initial maximally entangled state evolving under the presence of a structured environment in a weak and strong regime. We focus on the enhancement and degradation of maximal Concurrence when the system is…
Quantum entanglement is a crucial element of establishing the entangled network structure of the quantum Internet. Here we define a method to achieve controlled entanglement access in the quantum Internet. The proposed model defines…
Feynman's path integral formulation arose from his attempt to incorporate the Lagrangian framework into quantum mechanics, offering what he regarded as a more fundamental perspective than the Hamiltonian approach, particularly in the…
We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures -- we refer to it as entanglement circulation. The procedure involves optimization…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
Quantum variational optimization has been posed as an alternative to solve optimization problems faster and at a larger scale than what classical methods allow. In this paper we study systematically the role of entanglement, the structure…
We provide a detailed exposition of the connections between Boltzmann machines commonly utilized in machine learning problems and the ideas already well known in quantum statistical mechanics through Feynman's description of the same. We…
Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to…
Many interesting physical theories have analytic classical actions. We show how Feynman's path integral may be defined non-perturbatively, for such theories, without a Wick rotation to imaginary time. We start by introducing a class of…
Gate-model quantum computers provide an experimentally implementable architecture for near term quantum computations. To design a reduced quantum circuit that can simulate a high complexity reference quantum circuit, an optimization should…
We here put forward a new path-integral over Hilbert space and show that it reproduces quantum mechanics exactly. This approach works by optimizing the generating functional under a variation of the final state; it is hence an example of a…
Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We address this task by introducing a novel space-efficient…
Quantum circuits are time dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal synthesis of quantum circuits is intractable and heuristic methods must…