Related papers: Feynman's Entangled Paths to Optimized Circuit Des…
One of the most severe bottlenecks to reach high-precision predictions in QFT is the calculation of multiloop multileg Feynman integrals. Several new strategies have been proposed in the last years, allowing impressive results with deep…
Early efforts to understand complexity in field theory have primarily employed a geometric approach based on the concept of circuit complexity in quantum information theory. In a parallel vein, it has been proposed that certain deformations…
Protocols for distributed quantum systems commonly require the simultaneous availability of $n$ entangled states, each with a fidelity above some fixed minimum $F_{\mathrm{app}}$ relative to the target maximally-entangled state. However,…
When trying to use quantum-enhanced methods for optimization problems, the sheer number of options inhibits its adoption by industrial end users. Expert knowledge is required for the formulation and encoding of the use case, the selection…
The path integral approach to quantum mechanics requires a substantial generalisation to describe the dynamics of systems confined to bounded domains. Non-local boundary conditions can be introduced in Feynman's approach by means of…
Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network…
Quantum networks are gaining momentum in finding applications in a wide range of domains. However, little research has investigated the potential of a quantum network framework to enable highly reliable communications. The goal of this work…
Entanglement generation can be robust against noise in approaches that deliberately incorporate dissipation into the system dynamics. The presence of additional dissipation channels may, however, limit fidelity and speed of the process.…
Quantum networks are considered as a promising future platform for quantum information exchange and quantum applications, which have capabilities far beyond the traditional communication networks. Remote quantum entanglement is an essential…
We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal…
It is discussed an opportunity to introduce new class of quantum algorithms based on possibility to express amplitude of transition between two states of quantum system as sum of some function along all possible classical paths. Continuous…
There will be a fast-paced shift from conventional network systems to novel quantum networks that are supported by the quantum entanglement and teleportation, key technologies of the quantum era, to enable secured data transmissions in the…
Optimal-control techniques and a fast-approach scheme are used to implement a collisional control phase gate in a model of cold atoms in an optical lattice, significantly reducing the gate time as compared to adiabatic evolution while…
Unlike classical routing algorithms, quantum routing algorithms make use of entangled states - a type of resources that have a limited lifetime and need to be regenerated after consumption. In a nutshell, quantum routing algorithms have to…
Recently, various quantum computing and communication tasks have been implemented using IBM's superconductivity-based quantum computers which are available on the cloud. Here, we show that the circuits used in most of those works were not…
From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either…
Many problems in information theory can be reduced to optimizations over matrices, where the rank of the matrices is constrained. We establish a link between rank-constrained optimization and the theory of quantum entanglement. More…
We consider information spreading measures in randomly initialized variational quantum circuits and introduce entanglement diagnostics for efficient variational quantum/classical computations. We establish a robust connection between…
Despite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation…
A Euclidean path integral is used to find an optimal strategy for a firm under a Walrasian system, Pareto optimality and a non-cooperative feedback Nash Equilibrium. We define dynamic optimal strategies and develop a Feynman type path…