Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum-like Representation Algorithm: Transformation of Probabilistic Data into vectors on Blochs Sphere
76
0
0.0
(
0
)
Authors
Andrei Khrennikov
Ask ChatGPT about the research
No Arabic abstract
In this paper we present a simple algorithm for representation of statistical data of any origin by complex probability amplitudes. Numerical simulation with Mathematica-6 is performed. The Blochs sphere is used for visualization of results of numerical simulation. On the one hand, creation of such a quantum-like (QL) representation and its numerical approval is an important step in clarification of extremely complicated interrelation between classical and quantum randomness. On the other hand, it opens new possibilities for application the mathematical formalism of QM in other domains of science.
rate research
Read More
The gauge invariance of the evolution equations of tomographic probability distribution functions of quantum particles in an electromagnetic field is illustrated. Explicit expressions for the transformations of ordinary tomograms of states under a gauge transformation of electromagnetic field potentials are obtained. Gauge-independent optical and symplectic tomographic quasi-distributions and tomographic probability distributions of states of quantum system are introduced, and their evolution equations having the Liouville equation in corresponding representations as the classical limit are found.
In this paper we introduce a design for an optical topological cluster state computer constructed exclusively from a single quantum component. Unlike previous efforts we eliminate the need for on demand, high fidelity photon sources and detectors and replace them with the same device utilised to create photon/photon entanglement. This introduces highly probabilistic elements into the optical architecture while maintaining complete specificity of the structure and operation for a large scale computer. Photons in this system are continually recycled back into the preparation network, allowing for a arbitrarily deep 3D cluster to be prepared using a comparatively small number of photonic qubits and consequently the elimination of high frequency, deterministic photon sources.
The goal of quantum circuit transformation is to map a logical circuit to a physical device by inserting additional gates as few as possible in an acceptable amount of time. We present an effective approach called TSA to construct the mapping. It consists of two key steps: one makes use of a combined subgraph isomorphism and completion to initialize some candidate mappings, the other dynamically modifies the mappings by using tabu search-based adjustment. Our experiments show that, compared with state-of-the-art methods GA, SABRE and FiDLS proposed in the literature, TSA can generate mappings with a smaller number of additional gates and it has a better scalability for large-scale circuits.
We provide an algorithm that factorizes one-dimensional quantum walks into a protocol of two basic operations: A fixed conditional shift that transports particles between cells and suitable coin operators that act locally in each cell. This allows to tailor quantum walk protocols to any experimental setup by rephrasing it on the cell structure determined by the experimental limitations. We give the example of a walk defined on a qutrit chain compiled to run an a qubit chain.
We report an algorithm designed to perform computer-automated tuning of a single quantum dot with a charge sensor. The algorithm performs an adaptive measurement sequence of sub-sized stability diagrams until the single-electron regime is identified and reached. For each measurement, the signal processing module removes the physical background of the charge sensor to generate a binary image of charge transitions. Then, the image analysis module identifies the position and number of lines using two line detection schemes that are robust to noise and missing data.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
