Related papers: Feynman's Entangled Paths to Optimized Circuit Des…
We investigate the potential of bio-inspired evolutionary algorithms for designing quantum circuits with specific goals, focusing on two particular tasks. The first one is motivated by the ideas of Artificial Life that are used to reproduce…
Efforts to give an improved mathematical meaning to Feynman's path integral formulation of quantum mechanics started soon after its introduction and continue to this day. In the present paper, one common thread of development is followed…
The saddle points of a conventional Feynman path integral are not entangled, since they comprise a sequence of classical field configurations. We combine insights from field theory and tensor networks by constructing a Feynman path integral…
Numerical optimization methods such as hillclimbing and simulated annealing have been applied to search for highly entangled multi-qubit states. Here the genetic algorithm is applied to this optimization problem -- to search not only for…
Optimal routing is a fundamental challenge in quantum networking, with several approaches proposed to identify the most efficient path for end-to-end (e2e) entanglement generation between pairs of nodes. In this paper, we show that…
A method to optimize the cost of a quantum channel is developed. The goal is to determine the cheapest channel that produces prescribed output states for a given set of input states. This is essentially a quantum version of optimal…
We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to optimize the structure of the circuits and…
Quantum computing holds the potential to revolutionize various fields by efficiently tackling complex problems. At its core are quantum circuits, sequences of quantum gates manipulating quantum states. The selection of the right quantum…
Applications of decision diagrams in quantum circuit analysis have been an active research area. Our work introduces FeynmanDD, a new method utilizing standard and multi-terminal decision diagrams for quantum circuit simulation and…
Quantum information technology is one of the fastest growing sectors within information technology. By misleading interpretations of Bohr's definition of complementarity, the foundation of nonlocal correlations of entanglement is concealed…
This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to vertices and edges encode…
In this work we provide a method for generating quantum circuits preparing maximally multipartite entangled states using genetic programming. The presented method is faster that known realisations thanks to the applied fitness function and…
This article explores the application of the path integral formalism in describing synchronization phenomena in entangled networks, cavities, and reservoirs. We discuss the concept of using Lagrangian mechanics for systems undergoing…
We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement…
We characterize the set of optimal protocols for two-qubit entangling gates through a mechanism analysis based on quantum pathways, which allows us to compare and rank the different solutions. As an example of a flexible platform with a…
The path integral approach to quantum mechanics provides a method of quantization of dynamical systems directly from the Lagrange formalism. In field theory the method presents some advantages over Hamiltonian quantization. The Lagrange…
Solving real-world optimization problems with quantum computing requires choosing between a large number of options concerning formulation, encoding, algorithm and hardware. Finding good solution paths is challenging for end users and…
The performance of the Variational Quantum Eigensolver (VQE) is promising compared to other quantum algorithms, but also depends significantly on the appropriate design of the underlying quantum circuit. Recent research by Bowles, Ahmend \&…
Executing quantum circuits on currently available quantum computers requires compiling them to a representation that conforms to all restrictions imposed by the targeted architecture. Due to the limited connectivity of the devices' physical…
Optimal control theory is a versatile tool that presents a route to significantly improving figures of merit for quantum information tasks. We combine it here with the geometric theory for local equivalence classes of two-qubit operations…