Related papers: Probabilistic storage and retrieval of qubit phase…
We investigate capacitively coupled two-qubit quantum gates based on quantum dots. For exchange-only coded qubits electron spin $S$ and its projection $S_z$ are exact quantum numbers. Capacitive coupling between qubits, as distinct from…
We introduce an architecture for robust and scalable quantum computation using both stationary qubits (e.g. single photon sources made out of trapped atoms, molecules, ions, quantum dots, or defect centers in solids) and flying qubits (e.g.…
Stochastic restart may drastically reduce the expected run time of a computer algorithm, expedite the completion of a complex search process, or increase the turnover rate of an enzymatic reaction. These diverse first-passage-time (FPT)…
Probabilistic quantum error correction is an error-correcting procedure which uses postselection to determine if the encoded information was successfully restored. In this work, we deeply analyze probabilistic version of the…
Quantum squaring operation is a useful building block in implementing quantum algorithms such as linear regression, regularized least squares algorithm, order-finding algorithm, quantum search algorithm, Newton Raphson division, Euclidean…
Most near-term quantum information processing devices will not be capable of implementing quantum error correction and the associated logical quantum gate set. Instead, quantum circuits will be implemented directly using the physical native…
Obtaining high-fidelity and robust quantum gates is the key for scalable quantum computation, and one of the promising ways is to implement quantum gates using geometric phases, where the influence of local noises can be greatly reduced. To…
We show that the quantum Fisher information about any phase parameter encoded in a family of pure quantum states can be faithfully compressed into a single qubit, accompanied by a logarithmic amount of classical bits. When the phase is…
Rydberg atom arrays have recently emerged as one of the most promising platforms for quantum simulation and quantum information processing. However, as is the case for other experimental platforms, the longer-term success of the Rydberg…
We interface a spontaneous parametric down conversion (SPDC) crystal and a cold atomic ensemble and demonstrate a highly efficient quantum memory through polarization-encoded single-photon qubits. Specifically, narrowband heralded single…
Metastable atomic qubits are a highly promising platform for the realization of quantum computers, owing to their scalability and the possibility of converting leakage errors to erasure errors mid-circuit. Here, we demonstrate and…
We propose a new Quantum Key Recycling (QKR) protocol, which can tolerate the noise in the quantum channel. Our QKR protocol recycles the used keys according to the error rate. The key recycling rate of the pre-shared keys in our QKR…
This paper addresses the problem of designing universal quantum circuits to transform $k$ uses of a $d$-dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are…
We address estimation of one-parameter unitary gates for qubit systems and seek for optimal probes and measurements. Single- and two-qubit probes are analyzed in details focusing on precision and stability of the estimation procedure.…
We report a deterministic and exact protocol to reverse any unknown qubit-unitary operation, which simulates the time inversion of a closed qubit system. To avoid known no-go results on universal deterministic exact unitary inversion, we…
Quantum state preparation initializes the quantum registers and is essential for running quantum algorithms. Designing state preparation circuits that entangle qubits efficiently with fewer two-qubit gates enhances accuracy and alleviates…
$ $In its usual form, Grover's quantum search algorithm uses $O(\sqrt{N})$ queries and $O(\sqrt{N} \log N)$ other elementary gates to find a solution in an $N$-bit database. Grover in 2002 showed how to reduce the number of other gates to…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
Long coherence times and fast gate operations are desirable but often conflicting requirements for physical qubits. This conflict can be resolved by resorting to fast qubits for operations, and by storing their state in a `quantum memory'…
Quantum signal processing (QSP) and the quantum singular value transformation (QSVT) are pivotal tools for simplifying the development of quantum algorithms. These techniques leverage polynomial transformations on the eigenvalues or…