Related papers: Novel oracle constructions for quantum random acce…
In this paper we provide oracle complexity lower bounds for finding a point in a given set using a memory-constrained algorithm that has access to a separation oracle. We assume that the set is contained within the unit $d$-dimensional ball…
Resource consumption is an important issue in quantum information processing, particularly during the present NISQ era. In this paper, we investigate resource optimization of implementing multiple controlled operations, which are…
We present a new method to perform variation after projection in many-body systems on quantum computers that does not require performing explicit projection. The technique employs the notion of ``oracle'', generally used in quantum search…
We consider a quantum memory scheme based on the conversion of a signal pulse into a long-lived spin coherence via stimulated off-resonant Raman process. For a storing medium consisting of alkali atoms, we have calculated the Autler-Townes…
Orbital-free density functional theory (OFDFT) offers a challenging way of electronic-structure calculations scaled as $\mathcal{O}(N)$ computation for system size $N$. We here develop a scheme of the OFDFT calculations based on the…
Quantum supremacy in many applications using well-known quantum algorithms rely on availability of data in quantum format. Quantum Random Access Memory (QRAM), an equivalent of classical Random Access Memory (RAM), fulfills this…
A Hadamard-free Clifford transformation is a circuit composed of quantum Phase (P), CZ, and CNOT gates. It is known that such a circuit can be written as a three-stage computation, -P-CZ-CNOT-, where each stage consists only of gates of the…
We give an oracle separation between QMA and QCMA for quantum algorithms that have bounded adaptivity in their oracle queries; that is, the number of rounds of oracle calls is small, though each round may involve polynomially many queries…
Quantum algorithms are a very promising field. However, creating and manipulating these kind of algorithms is a very complex task, specially for software engineers used to work at higher abstraction levels. The work presented here is part…
Quantum memories with high efficiency and fidelity are essential for long-distance quantum communication and information processing. Techniques have been developed for quantum memories based on atomic ensembles. The atomic memories relying…
Proposals for quantum random access memory (QRAM) generally have a binary-tree structure, and thus require hardware that is exponential in the depth of the QRAM. For solid-state based devices, a fabrication yield that is less than $100\%$…
Reversible computation is one of the most promising emerging technologies of the future. The usage of reversible circuits in computing devices can lead to a significantly lower power consumption. In this paper we study reversible logic…
We propose a family of recursive cutting-plane algorithms to solve feasibility problems with constrained memory, which can also be used for first-order convex optimization. Precisely, in order to find a point within a ball of radius…
We study the (in)feasibility of quantum pseudorandom notions in a quantum analog of the random oracle model, where all the parties, including the adversary, have oracle access to the same Haar random unitary. In this model, we show the…
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…
We observe how an active (i.e., requring $2^n$ parallel control operations) QRAM-like effect $$\sum_{y=0}^{N-1} |y\rangle\langle y| \otimes U^y_{\text{result},\text{memory}_y}$$ can be realized, as a quantum circuit of depth $O(n+\sqrt m)$…
Grover's algorithm is a well-known contribution to quantum computing. It searches one value within an unordered sequence faster than any classical algorithm. A fundamental part of this algorithm is the so-called oracle, a quantum circuit…
A $n^d \xrightarrow{p} 1$ Quantum Random Access Code (QRAC) is a communication task where Alice encodes $n$ classical bits into quantum states of dimension $d$ and transmits them to Bob, who performs appropriate measurements to recover the…
We present the first exact quantum adder with sublinear depth and no ancilla qubits. Our construction is based on classical reversible logic only and employs low-depth implementations for the CNOT ladder operator and the Toffoli ladder…
Magnetic random access memory schemes employing magnetoelectric coupling to write binary information promise outstanding energy efficiency. We propose and demonstrate a purely antiferromagnetic magnetoelectric random access memory…