Related papers: Partition of 3-qubits using local gates
Quantum computers promise to solve certain problems exponentially faster than possible classically but are challenging to build because of their increased susceptibility to errors. Remarkably, however, it is possible to detect and correct…
It is challenging to build scalable quantum processors capable of both parallel control and local operation. As a promising platform to overcome this challenge, optical lattices offer exceptional parallelism. However, it has been struggling…
Quantum entanglement and its paradoxical properties hold the key to an information processing revolution. Much attention has focused recently on the challenging problem of characterizing entanglement. Entanglement for a two qubit system is…
Entangling gates between qubits are a crucial component for performing algorithms in quantum computers. However, any quantum algorithm must ultimately operate on error-protected logical qubits encoded in high-dimensional systems. Typically,…
We solve the entanglement classification under stochastic local operations and classical communication (SLOCC) for general n-qubit states. For two arbitrary pure n-qubit states connected via local operations, we establish an equation…
We find an operational interpretation for the 4-tangle as a type of residual entanglement, somewhat similar to the interpretation of the 3-tangle. Using this remarkable interpretation, we are able to find the class of maximally entangled…
Efficient synthesis of arbitrary quantum states and unitaries from a universal fault-tolerant gate-set e.g. Clifford+T is a key subroutine in quantum computation. As large quantum algorithms feature many qubits that encode coherent quantum…
We introduce an entanglement criterion to exclude full separability of quantum states. We present numerical evidence that the criterion is necessary and sufficient for the class of GHZ diagonal three-qubit states and estimate the volume of…
We show that the manifold of quantum states is endowed with a rich and nontrivial geometric structure. We derive the Fubini-Study metric of the projective Hilbert space of a multi-qubit quantum system, endowing it with a Riemannian metric…
The states in the three-qubit GHZ SLOCC class can exhibit diverse entanglement patterns, as they may have no entanglement in any reduced subsystems, or show entanglement across one, two, or all three bipartite cuts. Significant research has…
We study the interconversion of multipartite symmetric $N$-qubit states under stochastic local operations and classical communication (SLOCC). We demonstrate that if two symmetric states can be connected with a nonsymmetric invertible local…
Variational quantum algorithms are believed to be promising for solving computationally hard problems and are often comprised of repeated layers of quantum gates. An example thereof is the quantum approximate optimization algorithm (QAOA),…
It is known that every two-qubit unitary operation has Schmidt rank one, two or four, and the construction of three-qubit unitary gates in terms of Schmidt rank remains an open problem. We explicitly construct the gates of Schmidt rank from…
We investigate whether pure entangled states can be associated to a measurement basis in which all vectors are local unitary transformations of the original state. We prove that for bipartite states with a local dimension that is either $2,…
The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146…
We show how to construct a multi-qubit control gate on a quantum register of an arbitrary size N. This gate performs a single-qubit operation on a specific qubit conditioned by the state of other N-1 qubits. We provide an algorithm how to…
Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two…
Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC)…
A quantum algorithm can be decomposed into a sequence consisting of single qubit and 2-qubit entangling gates. To optimize the decomposition and achieve more efficient construction of the quantum circuit, we can replace multiple 2-qubit…
As quantum computing resources remain scarce and error rates high, minimizing the resource consumption of quantum circuits is essential for achieving practical quantum advantage. Here we consider the natural problem of, given a circuit $C$,…