Related papers: Quantum search with non--orthogonal entangled stat…
We report on an experiment on Grover's quantum search algorithm showing that {\em classical waves} can search a $N$-item database as efficiently as quantum mechanics can. The transverse beam profile of a short laser pulse is processed…
We describe a method for private database queries using exchange of quantum states with bits encoded in mutually incompatible bases. For technology with limited coherence time, the database vendor can announce the encoding after a suitable…
We consider the problem of private set membership aggregation of $N$ parties by using an entangled quantum state. In this setting, the $N$ parties, which share an entangled state, aim to \emph{privately} know the number of times each…
Many important results in modern quantum information theory have been obtained for an idealized situation when the spacetime dependence of quantum phenomena is neglected. However the transmission and processing of (quantum) information is a…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
We discuss and generalize multi-particle entanglement based on statistical correlations using Ursell-Mayer type of cluster coefficients. Cluster coefficients are used to distinguish different, independent entangled systems as well as those…
Especially sparse quantum states can be efficiently encoded with simple classical data structures. We show the admissibility of using a classical database to encode quantum states for a few practical examples and argue in favor of further…
In previous work we have proposed a construction of quantum-like bits that could endow a large synchronizing classical system, for example of oscillators, with quantum-like function that is not compromised by decoherence. In the present…
Demonstrating quantum advantage has been a pressing challenge in the field. Most claimed quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner, which imposes a crucial constraint…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
Two orthogonal-state-based protocols of quantum key agreement (QKA) are proposed. The first protocol of QKA proposed here is designed for two-party QKA, whereas the second protocol is designed for multi-party QKA. Security of these…
Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum…
Quantum search has emerged as one of the most promising fields in quantum computing. State-of-the-art quantum search algorithms enable the search for specific elements in a distribution by monotonically increasing the density of these…
In previous work, we introduced a formalism that maps classical networks of nonlinear oscillators onto a quantum-like Hilbert space. We demonstrated that specific network transformations correspond to quantum gates, underscoring the…
In classical coding, a single quantum state is encoded into classical information. Decoding this classical information in order to regain the original quantum state is known to be impossible. However, one can attempt to construct a state…
Using the previously shared Einstein-Podolsky-Rosen pairs, a proposal which can be used to distribute a quantum key and identify the user's identification simultaneously is presented. In this scheme, two local unitary operations and the…
We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a…
Classical machine learning theory and theory of quantum computations are among of the most rapidly developing scientific areas in our days. In recent years, researchers investigated if quantum computing can help to improve classical machine…
In this paper we propose a general method to quantify how "quantum" a set of quantum states is. The idea is to gauge the quantumness of the set by the worst-case difficulty of transmitting the states through a purely classical communication…
Near-term quantum communication protocols suffer inevitably from channel noises, whose alleviation has been mostly attempted with resources such as multiparty entanglement or sophisticated experimental techniques. Generation of multiparty…