Related papers: A reductionistic approach to quantum computation
Structured decompositions of a desired unitary operator are employed to derive control schemes that achieve certain control objectives for finite-level quantum systems using only sequences of simple control pulses such as square waves with…
We describe a scheme for constructing quantum mechanics in which a quantum system is considered as a collection of open classical subsystems. This allows using the formal classical logic and classical probability theory in quantum…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
In this research notebook in the four-part, quantum computation and applications, quantum computation and algorithms, quantum communication protocol, and universal quantum computation for quantum engineers, researchers, and scientists, we…
This is an exposition of some of the aspects of quantum computation and quantum information that have connections with operator theory. After a brief introduction, we discuss quantum algorithms. We outline basic properties of quantum…
Quantum operations provide a general description of the state changes allowed by quantum mechanics. Simple necessary and sufficient conditions for an ideal quantum operation to be reversible by a unitary operation are derived in this paper.…
Starting with the first-order singular Lagrangian containing the redundant variables, the noncommutative quantum mechanics on a curved space is investigated by the constraint star-product quantization formalism of the projection operator…
A rigorous theory of quantum state reduction, the state change of the measured system caused by a measurement conditional upon the outcome of measurement, is developed fully within quantum mechanics without leading to the vicious circle…
Within context of quantum logic, it is possible to assign dispersion-free probabilities to experimental propositions pertaining to qubits. This makes qubits distinct from the rest of quantum systems since the latter do not admit…
Distributed computing seems to be a natural approach to overcome size limitations of quantum computers in terms of number of qubits. But one lacks an efficient distribution approach to deal systematically with potential algorithms. This…
A theory of quantum measurement was introduced some time ago that was based on the notion of the so-called separation status. This separation status had a spatial, local character, so that the theory worked only in special cases.…
We consider the problem of constructing quantum operations or channels, if they exist, that transform a given set of quantum states $\{\rho_1, \dots, \rho_k\}$ to another such set $\{\hat\rho_1, \dots, \hat\rho_k\}$. In other words, we must…
The outcome statistics of an informationally complete quantum measurement for a system in a given state can be used to evaluate the ensemble expectation of any linear operator in the same state, by averaging a function of the outcomes that…
Quantum models of computation are widely believed to be more powerful than classical ones. Efforts center on proving that, for a given problem, quantum algorithms are more resource efficient than any classical one. All this, however,…
An operational approach to quantum state reduction, the state change of the measured system caused by a measurement of an observable conditional upon the outcome of measurement, is founded without assuming the projection postulate in any…
Relational Quantum Mechanics (RQM) is an interpretation of quantum theory based on the idea of abolishing the notion of absolute states of systems, in favor of states of systems relative to other systems. Such a move is claimed to solve the…
Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in…
Reversible work extraction from identical quantum systems via collective operations was shown to be possible even without producing entanglement among the sub-parts. Here, we show that implementing such global operations necessarily imply…
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle…
A programmable quantum processor is a fundamental model of quantum computation. In this model, any quantum channel can be approximated by applying a fixed universal quantum operation onto an input state and a quantum `program' state, whose…