Related papers: Resource Quantification for the No-Programming The…
We introduce a resource theory of channels relevant to communication via quantum channels, in which the set of constant channels --- useless channels for communication tasks --- is considered as the free resource. We find that our theory…
Quantum computing has the potential to provide exponential performance benefits in processing over classical computing. It utilizes quantum mechanics phenomena (such as superposition, entanglement, and interference) to solve a computational…
Computer simulation of observable phenomena is an indispensable tool for engineering new technology, understanding the natural world, and studying human society. Yet the most interesting systems are often complex, such that simulating their…
Over the past 27 years, quantum computing has seen a huge rise in interest from both academia and industry. At the current rate, quantum computers are growing in size rapidly backed up by the increase of research in the field. Significant…
Quantum computing is an emerging paradigm that opens a new era for exponential computational speedup. Still, quantum computers have yet to be ready for commercial use. However, it is essential to train and qualify today the workforce that…
This article defines and proves basic properties of the standard quantum circuit model of computation. The model is developed abstractly in close analogy with (classical) deterministic and probabilistic circuits, without recourse to any…
In this work we present a publicly verifiable quantum money protocol which assumes close to no quantum computational capabilities. We rely on one-time memories which in turn can be built from quantum conjugate coding and hardware-based…
Motivated in part by John Wheeler's assertion that the continuum nature of Hilbert Space conceals the `it-from-bit' information-theoretic character of the quantum wavefunction, a theory of quantum physics (Rational Quantum Mechanics - RaQM)…
We show that no source encoding is needed in the definition of the capacity of a quantum channel for carrying quantum information. This allows us to use the coherent information maximized over all sources and and block sizes, but not…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available…
The recent development of general quantum resource theories has given a sound basis for the quantification of useful quantum effects. Nevertheless, the evaluation of a resource measure can be highly non-trivial, involving an optimisation…
Modern classical computing devices, except of simplest calculators, have von Neumann architecture, i.e., a part of the memory is used for the program and a part for the data. It is likely, that analogues of such architecture are also…
Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an…
Quantum Chemistry and Physics have been pinpointed as killer applications for quantum computers, and quantum algorithms have been designed to solve the Schr\"odinger equation with the wavefunction formalism. It is yet limited to small…
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field…
The No-Free-Lunch (NFL) theorem, which quantifies problem- and data-independent generalization errors regardless of the optimization process, provides a foundational framework for comprehending diverse learning protocols' potential. Despite…
No-cloning theorem is fundamental for quantum mechanics and for quantum information science that states an unknown quantum state cannot be cloned perfectly. However, we can try to clone a quantum state approximately with the optimal…