Building partially entangled states with Grover's amplitude amplification process
Hiroo Azuma
备注：
22 pages, Latex2e, 8 epsf figures. The title is changed and estimation of the number of quantum gates for our method is corrected. Many parts of the article are rewritten and should hopefully be clear
We discuss how to build some partially entangled states of $n$ two-state quantum systems (qubits). The optimal partially entangled state with a high degree of symmetry is considered to be useful for overcoming a shot noise limit of Ramsey spectroscopy under some decoherence. This state is invariant under permutation of any two qubits and inversion between the ground state $|0\ket$ and an excited state $|1\ket$ for each qubit. We show that using selective phase shifts in certain basis vectors and Grover's inversion about average operations, we can construct this high symmetric entangled state by $({polynomial in $n$})\times 2^{n/2}$ successive unitary transformations that are applied on two or three qubits. We can apply our method to build more general entangled states.
Watrous had presented the first proof of zero-knowledge property of a proof system against a quantum verifier. The key of the proof is the construction of a quantum simulator. In the construction, the 'failure state' is rotated to the 'success' state by a tricky operation which is initially developped for the amplification of QMA proof systems. This manuscript presents a new and simpler construction of a simulator. In the construction, we simply amplify the success probability of a classical simulator using Grover's amplification.
This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure database of n entries finding a marked element with a quadratic speedup. The algorithm requires a predefined number of runs to succeed with probability close to one.This article provides a description of the amplitude amplification quantum algorithm mechanism in a very short computational way, based on tensor products and provides a geometric presentation of the successive system states. All the basis changes are full…
The landmark Grover algorithm for amplitude amplification serves as an essential subroutine in various type of quantum algorithms, with guaranteed quantum speedup in query complexity. However, there have been no proposal to realize the original motivating application of the algorithm, i.e., the database search or more broadly the pattern matching in a practical setting, mainly due to the technical difficulty in efficiently implementing the data loading and amplitude amplification processes. In this paper, we propose a quantum algorithm that approximately executes the entire Grover database sea…
Grover's algorithm is an approximation of imaginary-time evolution
Institute of Physics, École Polytechnique Fédérale de Lausanne (EPFL)（洛桑联邦理工学院物理研究所）；Centre for Quantum Science and Engineering, École Polytechnique Fédérale de Lausanne (EPFL)（洛桑联邦理工学院量子科学与工程中心）；Quantum Computing Center, Keio University（庆应义塾大学量子计算中心）；School of Physical and Mathematical Sciences, Nanyang Technological University（南洋理工大学物理与数学科学学院）；Centre for Quantum Technologies, Nanyang Technological University（南洋理工大学量子技术中心）
A new approach to the classical limit of Grover's algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover's unitary operations, which drives pure quantum states to decohered mixed states. One can identify a specific element among $N$ unsorted elements by a probability of the order of unity after $k\sim N$ steps of classical amplification, which is realized by a combination of Grover's unitary operation and rapid dephasing, in contrast to $k\sim π\sqrt{N}/4$ steps in quantum mechanical amplification. The initial two-state system with enormously unbalance…
We propose an optical scheme, employing optical parametric down-converters interlaced with nonlinear sign gates (NSGs), that completely converts an $n$-photon Fock-state pump to $n$ signal-idler photon pairs when the down-converters' crystal lengths are chosen appropriately. The proof of this assertion relies on amplitude amplification, analogous to that employed in Grover search, applied to the full quantum dynamics of single-mode parametric down-conversion. When we require that all Grover iterations use the same crystal, and account for potential experimental limitations on crystal-length pr…
We review the basic theoretical underpinnings of the Grover algorithm, providing a rigorous and well motivated derivation. We then present a generalization of Grover's algorithm that searches an arbitrary subspace of the multi-dimensional Hilbert space using a diffusion operation and an amplitude amplification procedure that has been biased by unitary {\em steering operators}. We also outline a generalized Grover's algorithm that takes into account higher level correlations that could exist between database elements. In the traditional Grover algorithm, the Hadamard gate selects a uniform samp…
A physical implementation of the adiabatic Grover search is theoretically investigated in a system of N identical three-level atoms trapped in a single mode cavity. Some of the atoms are marked through the presence of an energy gap between their two ground states. The search is controlled by two partially delayed lasers which allow a deterministic adiabatic transfer from an initially entangled state to the marked states. Pulse schemes are proposed to satisfy the Grover speedup either exactly or approximately, and the success rate of the search is calculated.
Amplitude Amplification -- a key component of Grover's Search algorithm -- uses an iterative approach to systematically increase the probability of one or multiple target states. We present novel strategies to enhance the amplification procedure by partitioning the states into classes, whose probabilities are increased at different levels before or during amplification. The partitioning process is based on the binomial distribution. If the classes to which the search target states belong are known in advance, the number of iterations in the Amplitude Amplification algorithm can be drastically …
Device-independent quantum key distribution (DI-QKD) represents one of the most fascinating challenges in quantum communication, exploiting concepts of fundamental physics, namely Bell tests of nonlocality, to ensure the security of a communication link. This requires the loophole-free violation of a Bell inequality, which is intrinsically difficult due to losses in fibre optic transmission channels. Heralded photon amplification is a teleportation-based protocol that has been proposed as a means to overcome transmission loss for DI-QKD. Here we demonstrate heralded photon amplification for pa…
Evolution of entanglement with the proceeding of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one. The success probability of search can be seen as an operational measure of entanglement. This paper demonstrates an entanglement measure based on the performance of Grover's search algorithm for three and five qubit systems. We also show that although the overall pattern shows growth of entanglement, its rise to a maximum and then consequent decay, the presenc…
Weak-value amplification (WVA) provides a way for amplified detection of a tiny physical signal at the expense of a lower detection probability. Despite this trade-off, due to its robustness against certain types of noise, WVA has advantages over conventional measurements in precision metrology. Moreover, it has been shown that WVA-based metrology can reach the Heisenberg-limit using entangled resources, but preparing macroscopic entangled resources remains challenging. Here we demonstrate a novel WVA scheme based on iterative interactions, achieving the Heisenberg-limited precision scaling wi…
A multiparticle quantum superposition state has been generated by a novel phase-selective parametric amplifier of an entangled two-photon state. This realization is expected to open a new field of investigations on the persistence of the validity of the standard quantum theory for systems of increasing complexity, in a quasi decoherence-free environment. Because of its nonlocal structure the new system is expected to play a relevant role in the modern endeavor on quantum information and in the basic physics of entanglement.
We study some extensions of Grover's quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist. Finally, as our main result, we combine ideas from Grover's and Shor's quantum algorithms to perform approximate counting, which can be seen as an amplitude estimation process.
Energy-time entangled photon holes are shown to be relatively insensitive to photon loss due to absorption by atoms whose coherence times are longer than the time delays typically employed in nonlocal interferometry (a fraction of a nanosecond). Roughly speaking, the excited atoms do not retain any significant "which-path" information regarding the time at which a photon was absorbed. High-intensity entangled photon holes can also be amplified under similar conditions. Decoherence does occur from losses at beam splitters, and these results show that photon loss cannot always be adequately mode…
Beyond Worst-Case Branching: Quantum Tree Search via Amplitude Amplification
Department of Computer Science and Engineering, INESC-ID & Instituto Superior Técnico, University of Lisbon（里斯本大学高等理工学院计算机科学与工程系，INESC-ID）；University of Lisbon（里斯本大学）
Do Quantum AIs Dream in Paths? Path-Integral Slow Thinking through Grover Interference
Institute of Theoretical Physics, Chinese Academy of Sciences（中国科学院理论物理研究所）；Shenzhen International Quantum Academy（深圳国际量子研究院）；Hefei National Laboratory（合肥国家实验室）
We study an oracle operation, along with its circuit design, which combined with the Grover diffusion operator boosts the probability of finding minimum or maximum solutions on a weighted directed graph. We focus on a geometry of sequentially connected bipartite graphs, which naturally gives rise to solution spaces describable by gaussian distributions. We then demonstrate how an oracle which encodes these distributions can be used to solve for the optimal path via amplitude amplification. And finally, we explore the degree to which this algorithm is capable of solving cases which are generate…
We propose a measurement-based method to produce a maximally-entangled state from a partially-entangled pure state. Our goal can be thought of as entanglement distillation from a single copy of a partially-entangled state. The present approach involves local two-outcome weak measurements. We show that application of these local weak measurements leads to a probabilistic amplification of entanglement. In addition, we examine how the probability to find the maximally-entangled state is related to the entanglement of the input state. We also study the application of our method to a mixed initial …
Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum subroutines, when the computational qubits and the environment are coupled, and in general when the control over the quantum system is partial.
Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $λ$ of the initial state is comprised of the target states. In contrast, fixed-point search algorithms need only a reliable lower bound on this fraction, but, as a consequence, lose the very quadratic advantage that makes Grover's algorithm so appealing. Here we provide the first version of amplitude amplification that achieves fixed-point behavior without sacrificing the…
We investigate the use of amplitude amplification on the gate-based model of quantum computing as a means for solving combinatorial optimization problems. This study focuses primarily on QUBO (quadratic unconstrained binary optimization) problems, which are well-suited for qubit superposition states. Specifically, we demonstrate circuit designs which encode QUBOs as `cost oracle' operations $U_{\textrm{C}}$, which when combined with the standard Grover diffusion operator $U_{\textrm{s}}$ lead to high probabilities of measurement for states corresponding to the optimal and near optimal solution…
We study a qubit-oscillator system, with a time-dependent coupling coefficient, and present a scheme for generating entangled Schrödinger-cat states with large mean photon numbers and also a scheme that protects the cat states against dephasing caused by the nonlinearity in the system. We focus on the case where the qubit frequency is small compared to the oscillator frequency. We first present the exact quantum state evolution in the limit of infinitesimal qubit frequency. We then analyze the first-order effect of the nonzero qubit frequency. Our scheme works for a wide range of coupling stre…
In this work, we show the characterization of quantum iterations that would generally construct quantum amplitude amplification algorithms with a quadratic speedup, namely, quantum amplitude amplification operators (QAAOs). Exact quantum search algorithms that find a target with certainty and with a quadratic speedup can be composed of sequential applications of QAAO: existing quantum amplitude amplification algorithms thus turn out to be sequences of QAAOs. We show that an optimal and exact quantum amplitude amplification algorithm corresponds to the Grover algorithm together with a single it…
Entangled photon pairs-discrete light quanta that exhibit non-classical correlations-play a central role in quantum information and quantum communication technologies. It is a natural demand from technological applications on the intensity of the entangled photon pairs, such that sufficient signal strength can be achieved. Here we propose approaches based on klystron tubes that could potentially achieve stable amplification of the entangled photon pairs generated by spontaneous parametric down conversion (SPDC) and entanglement transfer.
We propose a method for the fast generation of nonclassical ground states of the Rabi model in the ultrastrong and deep-strong coupling regimes via the shortcuts-to-adiabatic (STA) dynamics. The time-dependent quantum Rabi model is simulated by applying parametric amplification to the Jaynes-Cummings model. Using experimentally feasible parametric drive, this STA protocol can generate large-size Schrödinger cat states, through a process that is 10 times faster compared to adiabatic protocols. Such fast evolution increases the robustness of our protocol against dissipation. Our method enables o…
Amplitude amplification is one of primary tools in building algorithms for quantum computers. This technique generalizes key ideas of the Grover search algorithm. Potentially useful modifications are connected with changing phases in the rotation operations and replacing the intermediate Hadamard transform with arbitrary unitary one. In addition, arbitrary initial distribution of the amplitudes may be prepared. We examine trade-off relations between measures of quantum coherence and the success probability in amplitude amplification processes. As measures of coherence, the geometric coherence …
We put forward an effective amplification protocol for protecting the single-photon entangled state of the time-bin qubit. The protocol only requires one pair of the single-photon entangled state and some auxiliary single photons. With the help of the 50:50 beam splitters, variable beam splitters with the transmission of $t$ and the polarizing beam splitters, we can increase the fidelity of the single-photon entangled state under $t<\frac{1}{2}$. Moreover, the encoded time-bin information can be perfectly contained. Our protocol is quite simple and economical. More importantly, it can be reali…
In the framework of the paraxial and of the slowly varying envelope approximations, with reference to a normally dispersive medium or to vacuum, the electromagnetic field is given as a continuous quantum superposition of non-dispersive and non-diffracting wave-packets (namely X-waves). Entangled states as pairs of elementary excitations traveling at (approximately) the same velocity are found in optical parametric amplification.
We show how polarisation measurements on the output fields generated by parametric down conversion will reveal a violation of multi-particle Bell inequalities, in the regime of both low and high output intensity. In this case each spatially separated system, upon which a measurement is performed, is comprised of more than one particle. In view of the formal analogy with spin systems, the proposal provides an opportunity to test the predictions of quantum mechanics for spatially separated higher spin states. Here the quantum behaviour possible even where measurements are performed on systems of…
The experimental verification of quantum features, such as entanglement, at large scales is extremely challenging because of environment-induced decoherence. Indeed, measurement techniques for demonstrating the quantumness of multiparticle systems in the presence of losses are difficult to define and, if not sufficiently accurate, they provide wrong conclusions. We present a Bell test where one photon of an entangled pair is amplified and then detected by threshold detectors, whose signals undergo postselection. The amplification is performed by a classical machine, which produces a fully sepa…
We propose a scheme for the observation of micro-macro entanglement in photon number based on amplifying and de-amplifying a single-photon entangled state in combination with homodyne quantum state tomography. The created micro-macro entangled state, which exists between the amplification and de-amplification steps, is a superposition of two components with mean photon numbers that differ by approximately a factor of three. We show that for reasonable values of photon loss it should be possible to detect micro-macro photon-number entanglement where the macro system has a mean number of one hun…
The study of optical parametric amplifiers (OPAs) has been successful in describing and creating nonclassical light for use in fields such as quantum metrology and quantum lithography [Agarwal, et al., J. Opt. Soc. Am. B, 24, 2 (2007)]. In this paper we present the theory of an OPA scheme utilizing an entangled state input. The scheme involves two identical OPAs seeded with the maximally path-entangled N00N state (|2,0>+|0,2>)/sqrt{2}. The stimulated amplification results in output state probability amplitudes that have a dependence on the number of photons in each mode, which differs greatly …
Evolution of entanglement with the processing of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one. Biham et al [14] have shown that the success probability of search algorithm can be seen as an operational measure of entanglement. Following the same line of thought, analytical expressions for entanglement measure for three and five qubit system have been derived, which reveals that entanglement measure based on Grover's search algorithm is valid for any sta…
We review some of quantum algorithms for search problems: Grover's search algorithm, its generalization to amplitude amplification, the applications of amplitude amplification to various problems and the recent quantum algorithms based on quantum walks.
Amplitude amplification is a central tool used in Grover's quantum search algorithm and has been used in various forms in numerous quantum algorithms since then. It has been shown to completely eliminate one-sided error of quantum search algorithms where input is accessed in the form of black-box queries. We generalize amplitude amplification for two-sided error quantum algorithm for decision problems in the familiar form where input is accessed in the form of initial states of quantum circuits and where arbitrary projective measurements may be used to ascertain success or failure. This genera…
Consider a Boolean function $χ: X \to \{0,1\}$ that partitions set $X$ between its good and bad elements, where $x$ is good if $χ(x)=1$ and bad otherwise. Consider also a quantum algorithm $\mathcal A$ such that $A |0\rangle= \sum_{x\in X} α_x |x\rangle$ is a quantum superposition of the elements of $X$, and let $a$ denote the probability that a good element is produced if $A |0\rangle$ is measured. If we repeat the process of running $A$, measuring the output, and using $χ$ to check the validity of the result, we shall expect to repeat $1/a$ times on the average before a solution is found. *A…
Grover's Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorithms and patterns for extracting information encoded in quantum states. In this paper, we introduce an optimization of the inversion-by-the-mean step of the algorithm. This optimization serves two purposes: from a practical perspective, it can lead to a performance improvement; from a theoretical one, it leads to a novel interpretation of the actual nature of this step. This step is a reflection, which is realized by (…
Scalable Quantum Reinforcement Learning on NISQ Devices with Dynamic-Circuit Qubit Reuse and Grover Optimization
Graduate School of Science and Technology, Keio University（Keio大学科学技术研究生院）；Graduate School of Information Science and Electrical Engineering, Kyushu University（九州大学信息科学与电气工程研究生院）；RIKEN Center for Computational Science（理化学研究所计算科学中心）
We propose a novel entanglement-creation scheme in a multi-atom ensemble, named entanglement amplification, which converts unentangled states into entangled states and amplifies less-entangled ones to maximally-entangled Greenberger-Horne-Zeilinger (GHZ) states. The scheme starts with a multi-atom ensemble initialized in a coherent spin state. By shifting the energy of a particular Dicke state, we break the Hilbert space of the ensemble into two isolated subspaces to tear the coherent spin state into two components so that entanglement is introduced. After that, we utilize the isolated subspac…
We study pseudo entropy for a particular linear combination of entangled states in qubit systems, two-dimensional free conformal field theories (CFT), and two-dimensional holographic CFT. We observe phenomena that the pseudo entropy can be parametrically large compared with the logarithm of the dimension of Hilbert space. We call these phenomena pseudo entropy amplification. The pseudo entropy amplification is analogous to the amplification of the weak value. In particular, our result suggests the holographic CFT does not lead the amplification as long as the non-perturbative effects are negli…
We describe the experimental implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits using NMR. The algorithm solves a generalisation of the Deutsch problem and distinguishes between even and odd functions using fewer function calls than is possible classically. The manipulation of entangled states of the two qubits is essential here, unlike the Deutsch-Jozsa algorithm and the Grover's search algorithm for two bits.
We show that a quantum-limited phase-preserving amplifier can act as a which-path information eraser when followed by heterodyne detection. This 'beam splitter with gain' implements a continuous joint measurement on the signal sources. As an application, we propose heralded concurrent remote entanglement generation between two qubits coupled dispersively to separate cavities. Dissimilar qubit-cavity pairs can be made indistinguishable by simple engineering of the cavity driving fields providing further experimental flexibility and the prospect for scalability. Additionally, we find an analytic…
