Related papers: A geometric theory of non-local two-qubit operatio…
Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such…
We construct a completely analog framework that emulates universal quantum gates and quantum algorithms. It is based on electronic circuits made of operational amplifiers, resistors and capacitors. In these circuits, input and output lines…
The problems related to the management of large quantum registers could be handled in the context of distributed quantum computation: unitary non-local transformations among spatially separated local processors are realized performing local…
Hardy's argument constitutes an elegantly logical test for identifying nonlocal features of multipartite correlations. In this paper, we investigate Hardy's nonlocal behavior within a broad class of operational theories, including the qubit…
Simulating quantum systems is one of the most important potential applications of quantum computers. The high-level circuit defining the simulation needs to be compiled into one that complies with hardware limitations such as qubit…
Confined geometries such as semiconductor quantum dots are promising candidates for fabricating quantum computing devices. When several quantum dots are in proximity, spatial correlation between electrons in the system becomes significant.…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
The barren plateau phenomenon is one of the main obstacles to implementing variational quantum algorithms in the current generation of quantum processors. Here, we introduce a method capable of avoiding the barren plateau phenomenon in the…
We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum…
Non-invertible symmetries of quantum field theories and many-body systems generalize the concept of symmetries by allowing non-invertible operations in addition to more ordinary invertible ones described by groups. The aim of this paper is…
The algebraic formulation of the quantum group covariant noncommutative geometry in the framework of the $R$-matrix approach to the theory of quantum groups is given. We consider structure groups taking values in the quantum groups and…
An obstacle affecting any proposal for a topological quantum computer based on Ising anyons is that quasiparticle braiding can only implement a finite (non-universal) set of quantum operations. The computational power of this restricted set…
Local or nonlocal character of quantum states can be quantified and is subject to various bounds that can be formulated as complementarity relations. Here, we investigate the local vs. nonlocal character of pure three-qubit states by a…
The task of non-local quantum computation requires implementation of a unitary on $n$ qubits between two parties with only one round of communication, ideally with minimal pre-shared entanglement. We introduce a new protocol that makes use…
We use a novel optimization procedure that includes the temporal and spatial parameters of the pulses acting on arrays of trapped neutral atoms, to prepare entangling gates in N-qubits systems. The spatio-temporal control allows treating a…
This paper introduces a quaternionic analogue of toric geometry by developing the theory of local $Q^n := Sp(1)^n$-actions on 4n-dimensional manifolds, modeled on the regular representation. We identify obstructions that measure the failure…
We present a way to physically realize a circulant 2-qubit entangling gate in the Kauffman-Jones version of SU(2) Chern-Simons theory at level 4. Our approach uses qubit and qutrit ancillas, braids, fusions and interferometric measurements.…
The power of a quantum circuit is determined through the number of two-qubit entangling gates that can be performed within the coherence time of the system. In the absence of parallel quantum gate operations, this would make the quantum…
We propose and investigate a method to optimize recurrence entanglement purification protocols. The approach is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. Our method evaluates…
We quantify the capability of creating entanglement for a general physical interaction acting on two qubits. We give a procedure for optimizing the generation of entanglement. We also show that a Hamiltonian can create more entanglement if…