Related papers: Explore Simpler Eigenmarking: Quantum Entailment M…
This article introduces an enhancement to the Grover search algorithm to speed up computing the probability of finding good states. It suggests incorporating a rotation phase angle determined mathematically from the derivative of the model…
Measuring entanglement is a demanding task that usually requires full tomography of a quantum system, involving a number of observables that grows exponentially with the number of parties. Recently, it was suggested that adding a single…
Quantum illumination is a protocol for detecting a low-reflectivity target by using two-mode entangled states composed of signal and idler modes, which can outperform unentangled states. We study multi-qudit states for single-shot detection…
Grover's search algorithm is the cornerstone of many applications of quantum computing, providing a quadratic speed-up over classical methods. One limitation of the algorithm is that it requires knowledge of the number of solutions to…
Grover's algorithm is a quantum search algorithm that proceeds by repeated applications of the Grover operator and the Oracle until the state evolves to one of the target states. In the standard version of the algorithm, the Grover operator…
We present two scalable and entanglement-free methods for estimating the collective state of an n-qubit quantum computer. The first method consists of a fixed set of five quantum circuits-regardless of the number of qubits-that avoid the…
A recent experiment [Lanting et al., PRX, (2014)] claimed to provide evidence of up to $8$-qubit entanglement in a D-Wave quantum annealing device. However, entanglement was measured using qubit tunneling spectroscopy, a technique that…
The certification of quantum systems is essential for emerging quantum technologies, particularly in quantum communication, networks, and distributed computing, where maintaining a common reference frame across distant nodes poses…
Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries…
We apply quantum homomorphic encryption (QHE) schemes suitable for circuits with a polynomial number of $T/T^{\dagger}$-gates to Grover's algorithm, performing a simulation in Qiskit of a Grover circuit that contains 3 qubits. The…
We study the non-equilibrium dynamics of a pair of qubits made of two-level atoms separated in space with distance r and interacting with one common electromagnetic field but not directly with each other. Our calculation makes a weak…
The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…
We study the concurrence of four-qubit quantum states and provide analytical lower bounds of concurrence in terms of the monogamy inequality of concurrence for qubit systems. It is shown that these lower bounds are able to improve the…
Understanding the distributions of spectral estimators in low-rank random matrix models, also known as signal-plus-noise matrix models, is fundamentally important in various statistical learning problems, including network analysis, matrix…
We investigate the response to noise, in the form of glassy disorder present in circuit elements, in the success probability of the quantum phase estimation algorithm, a subroutine used to determine the eigenvalue - a phase - corresponding…
The search operation for a marked state by means of Grover's quantum searching algorithm is shown to be an element of group SU(2) which acts on a 2-dimensional space spanned by the marked state and the unmarked collective state. Based on…
Quantum algorithms for estimating the eigenvalues of matrices, including the phase estimation algorithm, serve as core subroutines in a wide range of quantum algorithms, including those in quantum chemistry and quantum machine learning. The…
Quantum states are represented by positive semidefinite Hermitian operators with unit trace, known as density matrices. An important subset of quantum states is that of separable states, the complement of which is the subset of…
Quantum phase estimation is a cornerstone in quantum algorithm design, allowing for the inference of eigenvalues of exponentially-large sparse matrices.The maximum rate at which these eigenvalues may be learned, --known as the Heisenberg…
Due to the great difficulty in scalability, quantum computers are limited in the number of qubits during the early stages of the quantum computing regime. In addition to the required qubits for storing the corresponding eigenvector, suppose…