Related papers: Non-local computation of quantum circuits with sma…
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is…
We study the possibility of designing $N^{o(1)}$-round protocols for problems of substantially super-linear polynomial-time (sequential) complexity in the model of Massively Parallel Computation, where $N$ is the input size. We show that if…
We present a protocol to construct an arbitrary quantum circuit. The quantum bits (qubits) are encoded in polarisation states of single photons. They are stored in spatially separated dense media deposed in an optical cavity. Specific…
Large-scale quantum computers will require quantum gate operations between widely separated qubits. A method for implementing such operations, known as quantum gate teleportation (QGT), requires only local operations, classical…
One of the crucial generic techniques for quantum computation is amplitude encoding. Although several approaches have been proposed, each of them often requires exponential classical-computational cost or an oracle whose explicit…
An $n$-qubit quantum circuit is said to be peaked if it has an output probability that is at least inverse-polynomially large as a function of $n$. We describe a classical algorithm with quasipolynomial runtime $n^{O(\log{n})}$ that…
The interaction with the environment is one of the main obstacles to be circumvented in practical implementations of quantum information tasks. The use of local unitaries, while not changing the initial entanglement present in a given…
Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has become a promising avenue for scaling up current quantum-computing experiments. Here, we introduce a scheme for joint cutting of two-qubit…
With recent experimental advancements demonstrating high-fidelity universal logic gates and basic programmability, Silicon-based spin quantum bit (qubit) have emerged as promising candidates for scalable quantum computing. However,…
The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum…
Any set of states which cannot be perfectly distinguished by local operations and classical communication (LOCC) alone, can always be locally distinguished using quantum teleportation with enough entanglement resource. However, in quantum…
Protocols for quantum measurement are an essential part of quantum computing. Measurements are no longer confined to the final step of computation but are increasingly embedded within quantum circuits as integral components of…
A quantum computer has the potential to effciently solve problems that are intractable for classical computers. Constructing a large-scale quantum processor, however, is challenging due to errors and noise inherent in real-world quantum…
The paper presents an analysis of entangling and nonlocal operations in a quantum nondemolition (QND) interaction between multimode light with orbital angular momentum and an atomic ensemble. A protocol consists of two QND operations with…
Simulations of quantum transport in coherent conductors have evolved into mature techniques that are used in fields of physics ranging from electrical engineering to quantum nanoelectronics and material science. The most efficient…
A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…
Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms with applications in the resolution of partial differential equations, Hamiltonian simulations, the loading of classical data on quantum…
Scaling quantum computers, i.e., quantum processing units (QPUs) to enable the execution of large quantum circuits is a major challenge, especially for applications that should provide a quantum advantage over classical algorithms. One…
We study the possibility of designing $N^{o(1)}$-round protocols for problems of substantially super-linear polynomial-time (sequential) complexity on the congested clique with about $N^{1/2}$ nodes, where $N$ is the input size. We show…
Fault-tolerant logical entangling gates are essential for scalable quantum computing, but are limited by the error rates and overheads of physical two-qubit gates and measurements. To address this limitation, we introduce phantom…