Related papers: Information Complexity of Quantum Gates
Quantum gates (unitary gates) on physical systems are usually implemented by controlling the Hamiltonian dynamics. When full descriptions of the Hamiltonians parameters is available, the set of implementable quantum gates is easily…
A framework for a quantum mechanical information theory is introduced that is based entirely on density operators, and gives rise to a unified description of classical correlation and quantum entanglement. Unlike in classical (Shannon)…
Query complexity measures the amount of information an algorithm needs about a problem to compute a solution. On a quantum computer there are different realizations of a query and we will show that these are not always equivalent. Our…
Quantum computation teaches us that quantum mechanics exhibits exponential complexity. We argue that the standard scientific paradigm of "predict and verify" cannot be applied to testing quantum mechanics in this limit of high complexity.…
To find the essential nature of quantum theory has been an important problem for not only theoretical interest but also applications to quantum technologies. In those studies on quantum foundations, the notion of uncertainty plays a primary…
We define metrics and measures to characterize the ratio of accessible quantum entanglement for complex network failures in the quantum Internet. A complex network failure models a situation in the quantum Internet in which a set of quantum…
It is not possible to obtain information about the observable properties of a quantum system without a physical interaction between the system and an external meter. This physical interaction is described by a unitary transformation of the…
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 develop an abstract way of defining linear-optics networks designed to perform quantum information tasks such as quantum gates. We will be mainly concerned with the nonlinear sign shift gate, but it will become obvious that all other…
Quantifying the complexity of quantum states that possess intrinsic structure, such as symmetry or encoding, in a fair manner constitutes a core challenge in the benchmarking of quantum technologies. This paper introduces the…
I review recent works showing that information geometry is a useful framework to characterize quantum coherence and entanglement. Quantum systems exhibit peculiar properties which cannot be justified by classical physics, e.g. quantum…
Entanglement is the defining characteristic of quantum mechanics. Bipartite entanglement is characterized by the von Neumann entropy. Entanglement is not just described by a number, however; it is also characterized by its level of…
The paper describes an approach to measuring convergence of an algorithm to its result in terms of an entropy-like function of partitions of its inputs of a given length. The goal is to look at the algorithmic data processing from the…
This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of…
Notions of circuit complexity and cost play a key role in quantum computing and simulation where they capture the (weighted) minimal number of gates that is required to implement a unitary. Similar notions also become increasingly prominent…
We investigate quantum information processing and manipulations in disordered systems of ultracold atoms and trapped ions. First, we demonstrate generation of entanglement and local realization of quantum gates in a quantum spin glass…
Recent progress in quantum information has led to the start of several large national and industrial efforts to build a quantum computer. Researchers are now working to overcome many scientific and technological challenges. The program's…
Any residual coupling of a quantum computer to the environment results in computational errors. Encoding quantum information in a so-called decoherence-free subspace provides means to avoid these errors. Despite tremendous progress in…
We analyse the problem of transmitting a number of unknown quantum states or one composite system in one go. We derive a lower bound on the performance of such process, measured in the entanglement fidelity. The obtained bound is…
A quantum processor (the programmable gate array) is a quantum network with a fixed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond…