Related papers: Unitary Complexity and the Uhlmann Transformation …
We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity. The approach is based on the true abstraction of the problem. The quantum program is expressed in terms of a high-level model together…
Unitarity provides mathematical and physical constraints on quantum information systems. e.g., in entanglement swapping, unitarity requires the same von Neumann entanglement entropy generation for either a particle interaction or an act of…
Quantum computing is fast evolving as a technology due to recent advances in hardware, software, as well as the development of promising applications. To use this technology for solving specific problems, a suitable quantum algorithm has to…
The rapid development of quantum computing technologies already made it possible to manipulate a collective state of several dozen of qubits. This success poses a strong demand on efficient and reliable methods for characterization and…
We describe a new and consistent perturbation theory for solid-state quantum computation with many qubits. The errors in the implementation of simple quantum logic operations caused by non-resonant transitions are estimated. We verify our…
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet there are ways of conveying information with exponentially…
We obtain the strongest separation between quantum and classical query complexity known to date -- specifically, we define a black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved…
The notion of quantum information related to the two different perspectives of the global and local states is examined. There is circularity in the definition of quantum information because we can speak only of the information of systems…
The computational cost of preparing a quantum state can be substantial depending on the structure of data to be encoded. Many quantum algorithms require repeated sampling to find the answer, mandating reconstruction of the same input state…
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a…
For quantum many-body systems in one dimension, computational complexity theory reveals that the evaluation of ground-state energy remains elusive on quantum computers, contrasting the existence of a classical algorithm for temperatures…
Let $\ket{\0}$ and $\ket{\1}$ be two states that are promised to come from known subsets of orthogonal subspaces, but are otherwise unknown. Our paper probes the question of what can be achieved with respect to the basis…
Understanding the computational complexity of learning efficient classical programs in various learning models has been a fundamental and important question in classical computational learning theory. In this work, we study the…
The impossibility of creating perfect identical copies of unknown quantum systems is a fundamental concept in quantum theory and one of the main non-classical properties of quantum information. This limitation imposed by quantum mechanics,…
Resource theory of imaginarity provides a useful framework to understand the role of complex numbers, which are essential in the formulation of quantum mechanics, in a mathematically rigorous way. In the first part of this article, we study…
Quantum information science has profoundly changed the ways we understand, store, and process information. A major challenge in this field is to look for an efficient means for classifying quantum state. For instance, one may want to…
Quantum query complexity plays an important role in studying quantum algorithms, which captures the most known quantum algorithms, such as search and period finding. A query algorithm applies $U_tO_x\cdots U_1O_xU_0$ to some input state,…
A key problem in quantum information science is to determine optimal protocols for the interconversion of entangled states shared between remote parties. While for two parties a large number of results in this direction is available, the…
Quantum gravity is likely the deepest problem facing current physics. While traditionally associated with short distance nonrenormalizability, it is evident that the long distance problem of unitarity, arising at high energies with black…
Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although…