相关论文: Physical Implementability for Reversible Magic Sta…
The method of using concepts and insight from quantum information theory in order to solve problems in reversible classical computing (introduced in Ref. [1]) have been generalized to irreversible classical computing. The method have been…
One-to-one reversible automata are introduced. Their applicability to a modelling of the quantum mechanical measurement process is discussed.
In quantum information theory, it is widely believed that entanglement concentration for bipartite pure states is asymptotically reversible. In order to examine this, we give a precise formulation of the problem, and show a trade-off…
The initialization of a quantum system into a certain state is a crucial aspect of quantum information science. While a variety of measurement strategies have been developed to characterize how well the system is initialized, for a given…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources.…
This article starts out with a detailed example illustrating the utility of applying quantum probability to psychology. Then it describes several alternative mathematical methods for mapping fundamental quantum concepts (such as state…
In both classical and quantum physics, irreversible processes are described by maps that contract the space of states. The change in volume has often been taken as a natural quantifier of the amount of irreversibility. In Bayesian…
High-fidelity logical magic states are a critical resource for fault-tolerant quantum computation, enabling non-Clifford logical operations through state injection. However, benchmarking these states presents significant challenges: one…
Quantum computers promise dramatic advantages over their classical counterparts, but the answer to the most basic question "What is the source of the power in quantum computing?" has remained elusive. Here we prove a remarkable equivalence…
We propose a new interpretation of objective deterministic chances in statistical physics based on physical computational complexity. This notion applies to a single physical system (be it an experimental set--up in the lab, or a subsystem…
We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with…
We discuss how to reconstruct quantum theory from operational postulates. In particular, the following postulates are consistent only with for classical probability theory and quantum theory. Logical Sharpness: There is a one-to-one map…
Magic is a property of quantum states that enables universal fault-tolerant quantum computing using simple sets of gate operations. Understanding the mechanisms by which magic is created or destroyed is, therefore, a crucial step towards…
Magic describes the distance of a quantum state to its closest stabilizer state. It is -- like entanglement -- a necessary resource for a potential quantum advantage over classical computing. We study magic, quantified by stabilizer…
Utilizing the tools of quantum optics to prepare and manipulate quantum states of motion of a mechanical resonator is currently one of the most promising routes to explore non-classicality at a macroscopic scale. An important quantum…
The epistemological interpretation of quantum mechanics is still in an unacceptable status. This becomes obvious if looking on the variety of interpretations currently under discussion. However, the physical community together with…
It is often argued that entanglement is at the root of the speedup for quantum compared to classical computation, and that one needs a sufficient amount of entanglement for this speedup to be manifest. In measurement-based quantum computing…
The familiar theories of physics have the feature that the application of the theory to make predictions in specific circumstances can be done by means of an algorithm. We propose a more precise formulation of this feature --- one based on…
The computational universality with an elementary gate set $\{H,CCZ\}$ can be transformed to the strict universality by using a maximally imaginary state $|+i\rangle$ and some non-imaginary ancillary qubits. From the viewpoint of…