Related papers: Quantum Computation via Sparse Distributed Represe…
A software product line models the variability of highly configurable systems. Complete exploration of all valid configurations (the configuration space) is infeasible as it grows exponentially with the number of features in the worst case.…
The concept of a superposition is a revolutionary novelty introduced by Quantum Mechanics. If a system may be in any one of two pure states x and y, we must consider that it may also be in any one of many superpositions of x and y. An…
Every quantum state can be represented as a probability distribution over the outcomes of an informationally complete measurement. But not all probability distributions correspond to quantum states. Quantum state space may thus be thought…
Quantum superposition is often phrased as the ability to add state vectors. In practice, however, the physical quantity is a ray (a rank-one projector), so each input specifies only a projector and leaves a gauge freedom in the phases of…
By comparing Schr\"odinger's cat with its classical counterpart, I show that a quantum superposition should be understood as an expectation over possible eigenstates weighted by wave-like probabilities. Upon the occurrence of a certain…
The quasidistributions corresponding to the diagonal representation of quantum states are discussed within the framework of operator-symbol construction. The tomographic-probability distribution describing the quantum state in the…
Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. Owing to…
Quantum sampling, a fundamental subroutine in numerous quantum algorithms, involves encoding a given probability distribution in the amplitudes of a pure state. Given the hefty cost of large-scale quantum storage, we initiate the study of…
A quantum computer is a hypothetical device in which the laws of quantum mechanics are used to introduce a degree of parallelism into computations and which could therefore significantly improve on the computational speed of a classical…
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…
Quantum mechanics allows coherent superposition between different states of matter. This quality is responsible for major non-classical phenomena that occur in quantum systems. Beyond states, coherent superpositions are also possible…
Through superposition, a quantum computer is capable of representing an exponentially large set of states, according to the number of qubits available. Quantum machine learning is a subfield of quantum computing that explores the potential…
We propose a novel method for image representation in quantum computers, which uses the two-dimensional (2-D) quantum states to locate each pixel in an image through row-location and column-location vectors for identifying each pixel…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
Representing signals with sparse vectors has a wide range of applications that range from image and video coding to shape representation and health monitoring. In many applications with real-time requirements, or that deal with…
A new approach suitable for distributed quantum machine learning and exhibiting memory is proposed for a photonic platform. This measurement-based quantum reservoir computing takes advantage of continuous variable cluster states as the main…
Quantum state tomography (QST) for reconstructing pure states requires exponentially increasing resources and measurements with the number of qubits by using state-of-the-art quantum compressive sensing (CS) methods. In this article, QST…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…
In the paper is discussed complete probabilistic description of quantum systems with application to multiqubit quantum computations. In simplest case it is a set of probabilities of transitions to some fixed set of states. The probabilities…
This paper describes an algorithmic system called SQT for the computer simulation of a wide class of quantum experiments on entangled particles. SQT maintains a hidden internal state for each particle and it provides an initialization…