Related papers: Optimal local implementation of non-local quantum …
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…
We address the question of how many maximally entangled photon pairs are needed in order to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily…
Exchange-only quantum computation is a version of spin-based quantum computation that entirely avoids the difficulty of controlling individual spins by a magnetic field and instead functions by sequences of exchange pulses. The challenge…
Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…
We propose an approach for quantifying a quantum circuit's quantumness as a means to understand the nature of quantum algorithmic speedups. Since quantum gates that do not preserve the computational basis are necessary for achieving quantum…
In quantum teleportation, the role of entanglement has been much discussed. It is known that entanglement is necessary for achieving non-classical teleportation fidelity. Here we focus on the amount of classical communication that is…
We examine the detailed scenario for implementing n-control-qubit Toffoli gates and select gates on ion-trap quantum computers, especially those that shuttle ions into interaction zones. We determine expected performance of these gates with…
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…
In this thesis, we investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC). In the first part, we analyze implementable computation over a given quantum network resource by…
Multi-controlled single-target (MC) gates are some of the most crucial building blocks for varied quantum algorithms. How to implement them optimally is thus a pivotal question. To answer this question in an architecture-independent manner,…
Two dual questions in quantum information theory are to determine the communication cost of simulating a bipartite unitary gate, and to determine their communication capacities. We present a bipartite unitary gate with two surprising…
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only…
In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns…
We demonstrate the use of optimal control to design two entropy-manipulating quantum gates which are more complex than the corresponding, commonly used, gates, such as CNOT and Toffoli (CCNOT): A 2-qubit gate called PE (polarization…
We study the amount of classical communication needed for distributed quantum information processing. In particular, we introduce the concept of "remote preparation" of a quantum state. Given an ensemble of states, Alice's task is to help…
We give trade-offs between classical communication, quantum communication, and entanglement for processing information in the Shannon-theoretic setting. We first prove a unit-resource capacity theorem that applies to the scenario where only…
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…
We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular we show that in order to transmit n qubits…
Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…
Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is…