Related papers: Quantum search with non--orthogonal entangled stat…
I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm. The quantum annealing…
Selecting a set of basis states is a common task in quantum computing, in order to increase and/or evaluate their probabilities. This is similar to designing WHERE clauses in classical database queries. Even though one can find heuristic…
Quantum algorithms have demonstrated provable speedups over classical counterparts, yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge. In this work, we decode the quantum…
We introduce a novel deterministic quantum search algorithm that provides a practical alternative to conventional probabilistic search approaches. Our scheme eliminates the inherent uncertainty of quantum search without relying on arbitrary…
We propose a scalable implementation of Grover's quantum search algorithm in a trapped-ion quantum information processor. The system is initialized in an entangled Dicke state by using simple adiabatic techniques. The…
We investigate macroscopic entanglement of quantum states in quantum computers, where we say a quantum state is entangled macroscopically if the state has superposition of macroscopically distinct states. The index $p$ of the macroscopic…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which…
We show that there exist bipartite quantum states which contain large hidden classical correlation that can be unlocked by a disproportionately small amount of classical communication. In particular, there are $(2n+1)$-qubit states for…
We show that communication without a shared reference frame is possible using entangled states. Both classical and quantum information can be communicated with perfect fidelity without a shared reference frame at a rate that asymptotically…
The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search…
Quantum algorithm can find target item in a database faster than any classical. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster: this is partial search. One can think of…
Prepare-and-measure scenarios, in their many forms, can be seen as the basic building blocks of communication tasks. As such, they can be used to analyze a diversity of classical and quantum protocols -- of which dense coding and random…
We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distribution. Amongst other properties, we (a) obtain speed-ups…
We outline a quantum convolutional coding technique for protecting a stream of classical bits and qubits. Our goal is to provide a framework for designing codes that approach the ``grandfather'' capacity of an entanglement-assisted quantum…
Efficient encoding of classical data into quantum state -- currently referred to as quantum encoding -- holds crucial significance in quantum computation. For finite-size databases and qubit registers, a common strategy of the quantum…
It has been shown that the apparent advantage of some quantum machine learning algorithms may be efficiently replicated using classical algorithms with suitable data access -- a process known as dequantization. Existing works on…
We expand on our work on Quantum Data Hiding -- hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two…
This thesis will be focused on the classical capacity of quantum channels, one of the first areas treated by quantum information theorists. The problem is fairly solved since some years. Nevertheless, this work will give me a reason to…
The encoding of classical to quantum data mapping through trigonometric functions within arithmetic-based quantum computation algorithms leads to the exploitation of multivariate distributions. The studied variational quantum gate learning…