Quantum state transformation method and device

Abstract

The invention discloses a quantum state transformation method and device. The method comprises the following steps: obtaining a group of quantum bits and element information of a matrix, wherein the first quantum state of one group of quantum bits is coded with the target value of the first type of subscript of the element; searching values and element numerical values of a second type of subscripts of the specific type of elements of which the values of the first type of subscripts are target values from element information of the matrix, and encoding the values and element numerical value information of the second type of subscripts to quantum states of a first bit and a second bit of a group of quantum bits; and encoding the element numerical value information of the specific class of elements to the quantum state amplitude of the third bit of the group of quantum bits so as to convert the first quantum state into a second quantum state in a first preset form. By utilizing the embodiment of the invention, the quantum state can be converted into the related quantum state applied to quantum random walk, and the related quantum state is used for classical simulation of quantum calculation so as to fill the related technical blank.

Description

technical field [0001] The invention belongs to the technical field of quantum computing, in particular to a quantum state transformation method and device. Background technique [0002] Quantum computers take advantage of the superposition of quantum and theoretically have the ability to accelerate exponentially in some cases. For example, it takes hundreds of years to crack an RSA key on a classical computer, but it only takes a few hours to execute a quantum algorithm on a quantum computer. However, at present, quantum computers are limited by the development of quantum chip hardware, which leads to the limited number of bits that can be manipulated, so the computing power is limited, and quantum algorithms cannot be generally run. Running quantum algorithms generally requires quantum computing simulations. [0003] During the simulation implementation of quantum algorithms, it is usually necessary to construct quantum algorithms with the help of various quantum logic g...

AI Technical Summary

Problems solved by technology

For example, quantum random walk technology has been widely used in quantum algorithms for solving Hamiltonian simulations and solving linear equations. However, in order to obtain the relevant quantum states used in quantum random walks, there is still a lack of corresponding quantum circuits.

If various quantum logic gates are used to construct equivalent quantum logic gates to achieve this requirement, the number of quantum logic gates required is huge, and the quantum circuits corresponding to the constructed quantum algorithms will be too complex, which seriously hinders the research of quantum computing

Images