Related papers: Obscure qubits and membership amplitudes
While quantum computers promise significant advantages, the complexity of quantum algorithms remains a major technological obstacle. We have developed and demonstrated an architecture-independent technique that simplifies adding control…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…
The notion of probability plays a crucial role in quantum mechanics. It appears in quantum mechanics as the Born rule. In modern mathematics which describes quantum mechanics, however, probability theory means nothing other than measure…
In a new branch of quantum computing, information is encoded into coherent states, the primary carriers of optical communication. To exploit it, quantum bits of these coherent states are needed, but it is notoriously hard to make…
In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices…
Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can…
Quantum probabilities are defined for several important physical cases characterizing measurements with multimode quantum systems. These are the probabilities for operationally testable measurements, for operationally uncertain…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
The quantum decision theory introduced recently is formulated as a quantum theory of measurement. It describes prospect states represented by complex vectors of a Hilbert space over a prospect lattice. The prospect operators, acting in this…
We propose a new concept, oblivious quantum computation, which requires performing oblivious transfer with respect to the computation outcome of the quantum computation, where the secrecy of the input qubits and the program to identify the…
Quantum interference lies at the heart of several quantum computational speed-ups and provides a striking example of a phenomenon with no classical counterpart. An intriguing feature of quantum interference arises in a three slit…
In the past few years there has been a tumultuous activity aimed at introducing novel conceptual schemes for quantum computing. The approach proposed in (Marzuoli A and Rasetti M 2002, 2005a) relies on the (re)coupling theory of SU(2)…
Blind Source Separation (BSS) is an active domain of Classical Information Processing. The development of Quantum Information Processing has made possible the appearance of Blind Quantum Source Separation (BQSS). This article discusses some…
The problem of defining quantum probabilities of composite events is considered. This problem is of high importance for the theory of quantum measurements and for quantum decision theory that is a part of measurement theory. We show that…
We propose an approach to optical quantum computation in which a deterministic entangling quantum gate may be performed using, on average, a few hundred coherently interacting optical elements (beamsplitters, phase shifters, single photon…
In quantum computing, the computation is achieved by linear operators in or between Hilbert spaces. In this work, we explore a new computation scheme, in which the linear operators in quantum computing are replaced by (higher) functors…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
Theory of quantum measurements is often classified as decision theory. An event in decision theory corresponds to the measurement of an observable. This analogy looks clear for operationally testable simple events. However, the situation is…
It is argued that the partition of a quantum system into subsystems is dictated by the set of operationally accessible interactions and measurements. The emergence of a multi-partite tensor product structure of the state-space and the…
Both discrete and continuous systems can be used to encode quantum information. Most quantum computation schemes propose encoding qubits in two-level systems, such as a two-level atom or an electron spin. Others exploit the use of an…