Related papers: Space-Bounded Communication Complexity of Unitarie…
We prove a trade-off relation between the entanglement cost and classical communication complexity of causal order structure of a protocol in distributed quantum information processing. We consider an implementation of a class of two-qubit…
Quantum programs today are written at a low level of abstraction - quantum circuits akin to assembly languages - and the unitary parts of even advanced quantum programming languages essentially function as circuit description languages.…
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…
By connecting multiple quantum computers (QCs) through classical and quantum channels, a quantum communication network can be formed. This gives rise to new applications such as blind quantum computing, distributed quantum computing, and…
Quantum key distribution (QKD) enables information-theoretic secure communication, yet its ultimate tolerance to noise and achievable transmission distance remain fundamentally constrained. We establish the maximum quantum bit error rate…
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical model, our bound extends the well known upper bound of Kremer, Nisan and…
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers. This dissertation…
The ability to realize high-fidelity quantum communication is one of the many facets required to build generic quantum computing devices. In addition to quantum processing, sensing, and storage, transferring the resulting quantum states…
Electronic control systems used for quantum computing have become increasingly complex as multiple qubit technologies employ larger numbers of qubits with higher fidelity targets. Whereas the control systems for different technologies share…
Unitary $k$-designs are distributions of unitary gates that match the Haar distribution up to its $k$-th statistical moment. They are a crucial resource for randomized quantum protocols. However, their implementation on encoded logical…
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…
The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the…
We consider the Unitary Permutation problem which consists, given $n$ unitary gates $U_1, \ldots, U_n$ and a permutation $\sigma$ of $\{1,\ldots, n\}$, in applying the unitary gates in the order specified by $\sigma$, i.e. in performing…
By considering quantum computation as a communication process, we relate its efficiency to a communication capacity. This formalism allows us to rederive lower bounds on the complexity of search algorithms. It also enables us to link the…
To apply network coding for quantum computation, we study the distributed implementation of unitary operations over all separated input and output nodes of quantum networks. We consider a setting of networks where quantum communication…
We introduce a framework for distributed quantum inference under communication constraints. In our model, $m$ distributed nodes each receive one copy of an unknown $d$-dimensional quantum state $\rho$, before communicating via a constrained…
Quantum computing is in an era of limited resources. Current hardware lacks high fidelity gates, long coherence times, and the number of computational units required to perform meaningful computation. Contemporary quantum devices typically…
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type…
In this letter, we introduce the computational-limited (comp-limited) signals, a communication capacity regime in which the signal time computational complexity overhead is the key constraint -- rather than power or bandwidth -- to the…
Clifford circuits -- i.e. circuits composed of only CNOT, Hadamard, and $\pi/4$ phase gates -- play a central role in the study of quantum computation. However, their computational power is limited: a well-known result of Gottesman and…