Related papers: Explore Simpler Eigenmarking: Quantum Entailment M…
The determination of the state fidelity and the detection of entanglement are fundamental problems in quantum information experiments. We investigate how these goals can be achieved with a minimal effort. We show that the fidelity of GHZ…
Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for entanglement measure defined in terms of success rate of Grover's search algorithm has…
We propose a methodology for implementing Grover's algorithm in the digital quantum simulation of disordered Ising models. The core concept revolves around using the evolution operator for the Ising model as the quantum oracle within…
The evolution of the quantum state of a system upon measurement results in state update. In this work, we investigate the characterization of updated states of multi-partite entangled qubit states with non-destructive weak measurements,…
We introduce a reliable compressive procedure to uniquely characterize any given low-rank quantum measurement using a minimal set of probe states that is based solely on data collected from the unknown measurement itself. The procedure is…
Finding ways to test the behaviour of quantum devices is a timely enterprise, especially in the light of the rapid development of quantum technologies. Device-independent self-testing is one desirable approach, as it makes minimal…
A complete, non-demolition procedure is established for measuring multi-qubit entangled states, such as the Bell-states and the GHZ-states, which is essential in certain processes of quantum communication, computation, and teleportation. No…
We have studied carefully the behaviors of entangled qubits on the IBM Rochester with various connectivities and under a "noisy" environment. A phase trajectory analysis based on our measurements of the GHZ-like states is performed. Our…
Certifying entanglement of a multipartite state is generally considered as a demanding task. Since an $N$ qubit state is parametrized by $4^{N}-1$ real numbers, one might naively expect that the measurement effort of generic entanglement…
We present the implementation of Grover's algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions, whose design only uses modular addition, word rotation, and bitwise exclusive or. Our…
Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for an entanglement measure defined in terms of success rate of Grover's search algorithm…
The recursion equation analysis of Grover's quantum search algorithm presented by Biham et al. [PRA 60, 2742 (1999)] is generalized. It is applied to the large class of Grover's type algorithms in which the Hadamard transform is replaced by…
Quantum computers have the potential to solve certain interesting problems significantly faster than classical computers. To exploit the power of a quantum computation it is necessary to perform inter-qubit operations and generate entangled…
Previous theoretical works showed that all pure two-qubit entangled states can generate one bit of local randomness and can be self-tested through the violation of proper Bell inequalities. We report an experiment in which nearly pure…
Self-testing refers to a device-independent way to uniquely identify the state and the measurement for uncharacterized quantum devices. The only information required comprises the number of measurements, the number of outputs of each…
This paper discusses an improvement to Grover's algorithm for searches where target states are Hamming weight eigenstates and search space is not ordered. It is shown that under these conditions search efficiency depends on the smaller…
Quantum entanglement lies at the heart in quantum information processing tasks. Although many criteria have been proposed, efficient and scalable methods to detect the entanglement of generally given quantum states are still not available…
We analyze the role played by entanglement in the dynamical evolution of Grover's search algorithm in the space of qubits. We show that the algorithm can be equivalently described as an iterative change of the entanglement between the…
We introduce a detection scheme for the state of a qubit, which is based on resonant few-photon transitions in a driven nonlinear resonator. The latter is parametrically coupled to the qubit and is used as its detector. Close to the…
Two indispensable algorithms in an introductory course on Quantum Computing are Grover's search algorithm and quantum phase estimation. Quantum counting is a simple yet beautiful blend of these two algorithms, and it is therefore an…