Related papers: Straddling-gates problem in multipartite quantum s…
Some physical implementation schemes of quantum computing can apply two-qubit gates only on certain pairs of qubits. These connectivity constraints are commonly viewed as a significant disadvantage. For example, compiling an unrestricted…
We present a quantum averaging theory (QAT) for analytically modeling unitary gate dynamics in driven quantum systems beyond the rotating-wave approximation. QAT addresses the simultaneous presence of distinct timescales by generating a…
The theory of quantum algorithms promises unprecedented benefits of harnessing the laws of quantum mechanics for solving certain computational problems. A persistent obstacle to using such algorithms for solving a wide range of real-world…
Much recent work on distributed quantum computing have focused on the use of entangled pairs and distributed two qubit gates. But there has also been work on efficient schemes for achieving multipartite entanglement between nodes in a…
TThe problem of finding the resource free, closest local unitary, to any bipartite unitary gate $U$ is addressed. Previously discussed as a measure of nonlocality, the distance $K_D(U)$ to the nearest product unitary has implications for…
We demonstrate that in a coupled two-qubit system any single-qubit gate can be decomposed into two conditional two-qubit gates and that any conditional two-qubit gate can be implemented by a manipulation analogous to that used for a…
Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence…
Quantum computing can be realized with numerous different hardware platforms and computational protocols. A highly promising approach to foster scalability is to apply a photonic platform combined with a measurement-induced quantum…
Preparing a quantum circuit that implements a given sparse state is an important building block that is necessary for many different quantum algorithms. In the context of fault-tolerant quantum computing, the so-called non-Clifford gates…
First, we show how the quantum circuits for generating and measuring multi-party entanglement of qubits can be translated to continuous quantum variables. We derive sufficient inseparability criteria for $N$-party continuous-variable states…
In recent years, there has been heightened interest in quantum teleportation, which allows for the transfer of unknown quantum states over arbitrary distances. Quantum teleportation not only serves as an essential ingredient in…
Entangling gates are an essential component of quantum computers. However, generating high-fidelity gates, in a scalable manner, remains a major challenge in all quantum information processing platforms. Accordingly, improving the fidelity…
We show that the bipartite separability of a pure qubit state hinges critically on the combinatorial structure of its computational-basis support. Using Boolean cube geometry, we introduce a taxonomy that distinguishes support-guaranteed…
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…
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…
The spin states of single electrons in gate-defined quantum dots satisfy crucial requirements for a practical quantum computer. These include extremely long coherence times, high-fidelity quantum operation, and the ability to shuttle…
In this study, we explore a form of quantum circuit complexity that extends to open systems. To illustrate our methodology, we focus on a basic model where the projective Hilbert space of states is depicted by the set of orientations in the…
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence…
Fast entangling gate operations are a fundamental prerequisite for quantum simulation and computation. We propose an entangling scheme for arbitrary pairs of ions in a linear crystal, harnessing the high electric polarizability of highly…
Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum…