Related papers: Quantum Hashing for Finite Abelian Groups
Quantum information processing requires a high degree of isolation from the detrimental effects of the environment as well as an extremely precise level of control on the way quantum dynamics unfolds in the information-processing system. In…
Quantum computing allows for the potential of significant advancements in both the speed and the capacity of widely used machine learning techniques. Here we employ quantum algorithms for the Hopfield network, which can be used for pattern…
Quantum cluster approaches offer new perspectives to study the complexities of macroscopic correlated fermion systems. These approaches can be understood as generalized mean-field theories. Quantum cluster approaches are non-perturbative…
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…
Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…
We develop a framework that allows a description of measurements in Hilbert spaces that are smaller than their natural representation. This description, which we call a "squashing model", consists of a squashing map that maps the input…
We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing. In particular our goal is to discriminate between two arbitrary quantum states with a prescribed error…
Noise causes severe difficulties in implementing quantum computing and quantum cryptography. Several schemes have been suggested to reduce this problem, mainly focusing on quantum computation. Motivated by quantum cryptography, we suggest a…
Quantum homomorphic encryption (QHE) is an encryption method that allows quantum computation to be performed on one party's private data with the program provided by another party, without revealing much information about the data nor the…
Fingerprinting is a technique in communication complexity in which two parties (Alice and Bob) with large data sets send short messages to a third party (a referee), who attempts to compute some function of the larger data sets. For the…
We generalize a recently discovered example of a private quantum subsystem to find private subsystems for Abelian subgroups of the $n$-qubit Pauli group, which exist in the absence of private subspaces. In doing so, we also connect these…
We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…
The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.
Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure…
I present a novel use of quantum annealing to solve the Set Splitting Problem using (QUBO) problem formulation. The contribution of the work is in formulating penalty functions that ensure the ground state of the QUBO Hamiltonian…
In the NISQ-era of quantum computing, we should not expect to see quantum devices that provide an exponential improvement in runtime for practical problems, due to the lack of error correction and small number of qubits available.…
We present the view of quantum algorithms as a search-theoretic problem. We show that the Fourier transform, used to solve the Abelian hidden subgroup problem, is an example of an efficient elimination observable which eliminates a constant…
Embedding image features into a binary Hamming space can improve both the speed and accuracy of large-scale query-by-example image retrieval systems. Supervised hashing aims to map the original features to compact binary codes in a manner…
Randomness extraction is an essential post-processing step in practical quantum cryptography systems. When statistical fluctuations are taken into consideration, the requirement of large input data size could heavily penalise the speed and…
The advancement of information processing into the realm of quantum mechanics promises a transcendence in computational power that will enable problems to be solved which are completely beyond the known abilities of any "classical"…