5 results about "Amplitude amplification" patented technology

The application belongs to the technical field of intelligent transportation, and particularly relates to a key scene generation method for an automatic driving vehicle based on quantum reinforcement learning. The method comprises the following steps: step one, constructing a simulation environment; step two, designing a quantum policy network for continuous control; step three, constructing a multi-dimensional sparse reward function; step four, performing interactive training and optimization on the quantum policy network; and step five, outputting a structured test case and performing visual analysis. The application models the generation of key scenes as a dynamic interaction process between an agent and an environment, efficiently explores sparse dangerous behaviors in a high-dimensional state space through a learnable quantum policy network, significantly improves the search efficiency of sparse key scenes in a high-dimensional scene space by introducing a quantum superposition state and a quantum amplitude amplification mechanism, and solves the combination explosion and sparsity problems faced by traditional methods.

The application discloses a kind of method for realizing distributed quantum amplitude amplification and related equipment, method includes: the initial success probability of quantum state is quantified based on target unitary operator, and configuration unitary operator is obtained from target unitary operator based on division parameter;Based on division parameter, Boolean function is split into the subfunction of preset quantity and sequentially distributed to each quantum node;Based on configuration unitary operator, the probability upper limit value of each quantum node is quantified using amplitude estimation;According to probability upper limit value, iteration number is obtained, and according to initial success probability, iteration upper limit is obtained;Based on iteration number, the measurement string corresponding to quantum node is iteratively output by quantum amplitude amplification algorithm, and then target string is verified and determined;Quantum operation result is obtained by summarizing the target string corresponding to all quantum nodes.The application can effectively avoid the dependence of existing distributed quantum computation on quantum communication means such as quantum teleportation, and can be widely applied in the field of data processing.

The invention relates to methods and systems for operating a quantum computing device to sample from an approximate stationary distribution of a Markov chain P having n states, through the construction and execution of a quantum circuit, said method comprising the step of: Initialize an ancilla qubit to the ∣0> state and at least one qubit register in its initial state; Prepare an unitary matrix U, which encodes a discriminant D in block form, allowing polynomial transformations of its singular values or eigenvalues; Apply successively a single qubit gate on the ancilla qubit and the ancilla controlled unitary matrix U on the qubit registers creating a reflection about an approximation of the stationary distribution of the Markov Chain P; and Prepare an approximation of the sought coherent quantum state associated with the stationary distribution, preferably using quantum amplitude amplification

Generalizations of quantum amplitude amplification and amplitude estimation algorithms work with non-boolean oracles (by way of definition, the action of a non-boolean oracle Uφ on an eigenstate |x is to apply a state-dependent phase-shift φ(x); unlike boolean oracles, the eigenvalues exp(iφ(x)) of a non-boolean oracle are not restricted to be ±1). The non-boolean amplitude amplification algorithm preferentially amplifies the amplitudes of the eigenstates based on the value of φ(x). Starting from a given initial superposition state |ψ0, the basis states with lower values of cos(φ) are amplified at the expense of the basis states with higher values of cos(φ). The non-boolean quantum mean estimation algorithm uses quantum phase estimation to estimate the expectation ψ0|Uφ|ψ0 (i.e., the expected value of exp(iφ(x)) for a random x sampled by making a measurement on |ψ0). The quantum mean estimation algorithm offers a quadratic speedup over its counterpart boolean algorithm known in the art.

The invention discloses a Grover algorithm-based dot-lattice chess game implementation method, which comprises the following steps of: performing quantum bit coding on a dot-lattice chess board of a dot-lattice chess game to generate an initial chessboard quantum state vector; then, based on a Grover algorithm, the initial chessboard quantum state vector is processed, and a target chessboard quantum state vector is determined; and finally, according to the target chessboard quantum state vector, determining a target path so as to realize a dot-lattice chess game according to the target path. Therefore, the classical chessboard state is converted into a quantum processable form through quantum bit coding, and the quantum parallelism and the amplitude amplification characteristic of the Grover algorithm are combined, so that the search complexity of the optimal chess moving path is reduced, the search efficiency is greatly improved, and the optimal solution of scores or opponent scores can be quickly found.