Related papers: Deriving Some Quantum Optical Identities Using the…
In this paper we consider a generalization of quantum hash functions for arbitrary groups. We show that quantum hash function exists for arbitrary abelian group. We construct a set of "good" automorphisms --- a key component of quantum hash…
Proofs of the quantum advantage available in imaging or detecting objects under quantum illumination can rely on optimal measurements without specifying what they are. We use the continuous-variable Gaussian quantum information formalism to…
Though quantum algorithm acts as an important role in quantum computation science, not only for providing a great vision for solving classically unsolvable problems, but also due to the fact that it gives a potential way of understanding…
We present graphical representation for genaralized quantum measurements (POVM). We represent POVM elements as Bloch vectors and find the conditions these vectors should satisfy in order to describe realizable physical measurements. We show…
We present an algorithm for the generalized search problem (searching $k$ marked items among $N$ items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity $O(\sqrt{N/k})$ as the…
Foster's network theorems and their extensions to higher orders involve resistance values and conductances. We establish identities concerning voltage values and conductances. Our identities are analogous to the extended Foster's…
I present and defend a new ontology for quantum theories (or ``interpretations'' of quantum theory) called Generative Quantum Theory (GQT). GQT postulates different sets of features, and the combination of these different features can help…
The paper is devoted to integral quantization, a procedure based on operator-valued measure and resolution of the identity. We insist on covariance properties in the important case where group representation theory is involved. We also…
For numerous applications of quantum theory it is desirable to be able to apply arbitrary unitary operations on a given quantum system. However, in particular situations only a subset of unitary operations is easily accessible. This raises…
Oriented object detection has been rapidly developed in the past few years, but most of these methods assume the training and testing images are under the same statistical distribution, which is far from reality. In this paper, we propose…
Quantum reading aims at retrieving classical information stored in an optical memory with low energy and high accuracy by exploiting the inherently quantum properties of light. We provide an optimal Gaussian strategy for quantum reading…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
The existence of indistinguishable quantum particles provides an explanation for various physical phenomena we observe in nature. We lay out a path for the study of indistinguishable particles in general probabilistic theories (GPTs) via…
Quantum computing has attracted much attention in recent decades, since it is believed to solve certain problems substantially faster than traditional computing methods. Theoretically, such an advance can be obtained by networks of the…
Basic concepts of quantum theory of information, principles of quantum calculations and the possibility of creation on this basis unique on calculation power and functioning principle device, named quantum computer, are briefly reviewed.…
We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.
Using coherent states in optical quantum process tomography is a practically-relevant approach. Here, we develop a framework for complete characterization of quantum-optical processes in terms of normally-ordered moments by using coherent…
In arXiv:0912.1346, four quantum dilogarithm identities containing infinitely many factors are proposed as wall-crossing formula for refined BPS invariant. We give algebraic proof of these identities using the formula for universal R-matrix…
Quantum Information Theory promises to speed up computation so is observed in real quantum computers as proved to its classical counterpart. This revolutionizes every field linked directly or indirectly with computation. Grover algorithm in…
Grover's quantum search algorithm drives a quantum computer from a prepared initial state to a desired final state by using selective transformations of these states. Here, we analyze a framework when one of the selective trasformations is…