Related papers: Mapping of Quantum Systems to the Probability Simp…
We study the mapping which occurs when a single qubit in an arbitrary state interacts with another qubit in a given, fixed state resulting in some unitary transformation on the two qubit system which, in effect, makes two copies of the…
We consider the space of probabilities {P(x)}, where the x are coordinates of a configuration space. Under the action of the translation group there is a natural metric over the space of parameters of the group given by the Fisher-Rao…
Quantum signal processing (QSP) and the quantum singular value transformation (QSVT) are pivotal tools for simplifying the development of quantum algorithms. These techniques leverage polynomial transformations on the eigenvalues or…
We analyse orthogonal bases in a composite $N\times N$ Hilbert space describing a bipartite quantum system and look for a basis with optimal single-sided mutual state distinguishability. This condition implies that in each subsystem the…
Quantum algorithms can be realized in the form of a quantum circuit. To map quantum circuit for specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighbourhood…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
We develop a means of simulating the evolution and measurement of a multipartite quantum state under discrete or continuous evolution using another quantum system with states and operators lying in a real Hilbert space. This extends…
We propose an extended quantum theory, in which the number K of parameters necessary to characterize a quantum state behaves as fourth power of the number N of distinguishable states. As the simplex of classical N-point probability…
We propose a simple model of classical open system consisting of two subsystems all stationary states of which correspond to phase synchronization between the subsystems. The model is generalized to quantum systems in a finite-dimensional…
The problems of Hadamard quantum coin flipping in n-trials and related generalized Fibonacci sequences of numbers were introduced in [1]. It was shown that for an arbitrary number of repeated consecutive states, probabilities are determined…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
We implement a hybrid quantum-classical model for image classification that compresses MNIST digit images into a low-dimensional feature space and then maps these features onto a 5-qubit quantum state. First, an autoencoder compresses each…
Nuclear Magnetic Ressonance (NMR) is a widely used technique, with a long history of applications in chemestry, medicine, and material science. Twenty years ago, it emerged as a reliable source for quantum computing too, since the work of…
This work discusses simple examples how quantum systems are obtained as subsystems of classical statistical systems. For a single qubit with arbitrary Hamiltonian and for the quantum particle in a harmonic potential we provide explicitly…
Transition amplitudes and transition probabilities are relevant to many areas of physics simulation, including the calculation of response properties and correlation functions. These quantities can also be related to solving linear systems…
We propose a formulation of quantum measurement within a modified framework of frames, in which a quantum system - a single qubit - is directly coupled to a classical measurement bit. The qubit is represented as a positive probability…
For quantum computation using photons, performing deterministic quantum gate operations is a challenge due to the probabilistic nature of the photon-photon interaction. Encoding qubits in multiple degrees-of-freedom of photons and…
Quantum process tomography conventionally uses a multitude of initial quantum states and then performs state tomography on the process output. Here we propose and study an alternative approach which requires only a single (or few) known…
In this paper, we propose a novel quantum multiple access technique based on optical coherent states. The information of several coherent state optical qubits is combined into a single qudit, which is the superposition of almost orthogonal…
We prove that universal quantum computation is possible using only (i) the physically natural measurement on two qubits which distinguishes the singlet from the triplet subspace, and (ii) qubits prepared in almost any three different…