Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

33 results about "Quantum Fourier transform" patented technology

In quantum computing, the quantum Fourier transform (for short: QFT) is a linear transformation on quantum bits, and is the quantum analogue of the inverse discrete Fourier transform. The quantum Fourier transform is a part of many quantum algorithms, notably Shor's algorithm for factoring and computing the discrete logarithm, the quantum phase estimation algorithm for estimating the eigenvalues of a unitary operator, and algorithms for the hidden subgroup problem.

Palm print database search method based on quantum algorithms

The invention provides a palm print database search method based on quantum algorithms. Four different quantum algorithms are respectively used in the three most important stages of palm print recognition. The search method comprises the following steps that 1, a palm print image is filtered by a quantum adaptive median filtering algorithm, and a fact can be observed from a filtering effect contrast chart that a better filtering effect can be obtained by the quantum adaptive median filtering algorithm utilized in the invention than a classic algorithm; 2, the characters of the palm print image are extracted by quantum Fourier conversion based on quantum parallelism, all palm print characters can be extracted by only one quantum Fourier conversion operation, and an analysis result shows that the extraction speed of the palm print characters is raised by the algorithm under the condition of well reserving palm print details; and 3, the palm print image is matched by a quantum set operation and a Grover algorithm. In comparison with the classic algorithm which requires N times of operation, the matching algorithm provided by the invention has the advantage that the position of the target palm print image can be found by only 1 / 2 N times of operation, and the probability of finding the position of the target image in the palm print database by the algorithm is close to 1.
Owner:HENAN POLYTECHNIC UNIV

Method for realizing quantum circuit design through quantum Haar wavelet transformation

The invention provides a method for realizing quantum circuit design through quantum Haar wavelet transformation, and belongs to the field of quantum information processing. According to the method, the existing quantum Fourier transform implementing technology is perfected and improved, and implementing circuits of two pieces of multi-layer quantum Haar wavelet transformation and two pieces of multi-layer quantum Haar wavelet inverse transformation are established separately by using extended tensor product and basic quantum bit gate (comprising quantum bit controlled door and single quantum bit gate). Based on analysis of the complex rates of the implementing circuits of the quantum Haar wavelet transformation and the quantum Haar wavelet inverse transformation, the complex rates of the implementing circuits of the two pieces of multi-layer quantum Haar wavelet transformation and the two pieces of multi-layer quantum Haar wavelet inverse transformation are Theta(n2) for one data set with 2n elements, and other typical and rapid Haar wavelet transformation cannot achieve the aim. The method is suitable for the fields of algorithms such as compression, denoising, encryption and decryption of images of actual information processing application, and has important significance in popularization of perfection and application of a quantum computing theory.
Owner:GUANGXI NORMAL UNIV

Gaussian distribution quantum state determination method and device and electronic equipment

The invention discloses a Gaussian distribution quantum state determination method and device and electronic equipment and relates to the technical field of quanta. The specific implementation schemeis as follows: obtaining an initial Gaussian distribution quantum state; performing quantum Fourier transform on the initial Gaussian distribution quantum state to obtain a quantum transform result; evolving the quantum transformation result to obtain a quantum evolution result; and performing inverse quantum Fourier transform on the quantum evolution result to obtain a target Gaussian distribution quantum state. In the process of preparing the target Gaussian distribution quantum state, the coefficient of each component in the target Gaussian distribution quantum state does not need to be separately determined; the target Gaussian distribution quantum state can be obtained by carrying out quantum Fourier transform on the initial Gaussian distribution quantum state, then quantum evolutionis carried out and quantum inverse Fourier transform is carried out on the quantum evolution result, so that the calculation amount can be reduced, and the preparation complexity of the target Gaussian distribution quantum state is reduced.
Owner:BEIJING BAIDU NETCOM SCI & TECH CO LTD

Multi-quantum-bit quantum Fourier transform line-oriented segmentation method

PendingCN114529003AEasy to split multiple timesThe need to reduce the number of qubitsQuantum computersQuantum circuitSoftware engineering
The invention discloses a segmentation method for a multi-quantum-bit quantum Fourier transform line. The invention provides a multi-bit quantum Fourier transform line segmentation method, and mainly solves the problem that an existing small-scale quantum computer cannot operate a large-scale multi-bit quantum Fourier transform line due to insufficient quantum bits. According to the scheme, the method comprises the following steps: performing line adjustment on a quantum Fourier transform line, and dividing the adjusted line into a plurality of sub-lines; initial quantum state preparation and measurement module setting are respectively performed on the input and output of each sub-circuit to form a plurality of sub-quantum circuits, and the sub-quantum circuits are operated on a small-scale quantum computer; and performing classical calculation on the operation results of all the sub-quantum circuits so as to restore the operation results into the operation result of the original large-scale quantum Fourier transform circuit. According to the method, projection measurement of part of sub-lines is optimized, the number of quantum lines running on a quantum computer is reduced, the width of the quantum lines is effectively reduced through quantum-classical hybrid calculation, and the method can be used for phase estimation of multiple quantum bits in quantum communication and quantum calculation.
Owner:XIDIAN UNIV

Finite field discrete logarithm quantum solving line optimization construction method

The invention relates to a finite field discrete logarithm quantum solving line optimization construction method, which comprises the following steps of: constructing an addition carry gate line for afinite field discrete logarithm so as to realize equivalent conversion of a multiplication cyclic group generation element; setting an addition carry gate auxiliary bit, and recursively executing theoperation of an addition carry gate through an addition quantum circuit; carrying out comparison operation by utilizing an addition carry gate circuit, and judging carry information when the quantumregister and the constant are added so as to realize modular N addition quantum circuit optimization; achieving multiplication operation through modular N addition operation, and constructing a modular N multiplication quantum circuit; achieving modular exponentiation operation through modular N multiplication operation, and constructing a modular exponentiation quantum circuit; combining a modular exponentiation quantum circuit and an existing quantum Fourier transform quantum circuit to construct a quantum algorithm circuit for solving discrete logarithms in a finite field. According to themethod, the modular addition process is realized through the logic quantum circuit, the logarithm solving calculation amount and complexity are reduced, the software and hardware operation load is reduced, and the method has a relatively strong application prospect.
Owner:PLA STRATEGIC SUPPORT FORCE INFORMATION ENG UNIV PLA SSF IEU

Finite Field Discrete Logarithmic Quantum Solving Circuit Optimization Construction Method

The present invention relates to a finite-field discrete logarithm quantum solution circuit optimization construction method, comprising: constructing an addition carry gate circuit for finite-field discrete logarithms, so as to realize equivalent conversion of multiplication cyclic group generators; setting the addition carry gate Auxiliary bits, and realize recursively performing the operation of the addition carry gate through the addition quantum circuit; use the addition carry gate circuit to perform the comparison operation, and judge the carry information when the quantum register and the constant are added, so as to realize the optimization of the modulo N addition quantum circuit; through the modulo N The addition operation realizes the multiplication operation, and constructs the modular N multiplication quantum circuit; realizes the modular exponentiation operation through the modular N multiplication operation, and constructs the modular exponentiation quantum circuit; combines the modular exponentiation quantum circuit and the existing quantum Fourier transform quantum circuit, constructs and realizes the finite field A quantum algorithm circuit for solving discrete logarithms. The invention realizes the modular addition process through the logic quantum circuit, reduces the calculation amount and complexity of the logarithm solution, reduces the calculation load of software and hardware, and has strong application prospects.
Owner:PLA STRATEGIC SUPPORT FORCE INFORMATION ENG UNIV PLA SSF IEU

Quantum stealth state transfer system classification method based on Schmidt rank relation

The invention provides a quantum stealth transfer system classification method based on a Schmidt rank relationship. The method comprises the following steps: step 1, selecting two states as a first entangled state and a second entangled state respectively; step 2, taking the first entangled state as a pre-transmission entangled state, taking the second entangled state as an entangled state of thequantum channel, taking the Schmidt rank of the pre-transmission entangled state as nI, taking the Schmidt rank of the entangled state of the quantum channel as nC, and taking the Schmidt rank of a total subsystem formed by the pre-transmission entangled state and the quantum channel; step 3, if the Schmidt rank meets the condition that nC is greater than or equal to nI, executing the step 4; otherwise, reselecting two states from the entangled states as a first entangled state and a second entangled state, and executing the step 2; and step 4, if nS is equal to nI, obtaining a projection measurement base and a unitary transformation matrix through linear transformation; and if nS is equal to knI, obtaining a projection measurement base and a unitary transformation matrix in a quantum Fourier transformation mode. According to the method, a projection measurement base and a unitary transformation matrix are obtained through linear transformation and quantum Fourier transformation respectively.
Owner:NORTHWEST UNIV(CN) +1

Cloud quantum privacy query method based on user agent

The invention discloses a cloud quantum privacy query method based on a user agent. The method comprises the following steps: negotiating with the user agent through a classical channel by utilizing adatabase to obtain a first shared key; encrypting the quantum state sequence generated according to the key by using a database to generate a first mixed sequence, and transmitting the first mixed sequence to a cloud service provider; performing quantum delegation calculation on the first mixed sequence by using a cloud service provider to generate a second mixed sequence, and transmitting the second mixed sequence to a user agent; decrypting the second mixed sequence by using the user agent to generate a third mixed sequence, and transmitting the third mixed sequence to the query user group;and decrypting the third mixed sequence by utilizing the query user to obtain a query quantum state, and performing quantum privacy query according to the obtained query quantum state. The whole delegation encryption process is subjected to dual encryption in a cloud server delegation encryption calculation mode, and the efficiency of whole quantum transmission is improved by utilizing the advantage that multiple quantum keys are transmitted at a time through quantum Fourier transform.
Owner:CHENGDU UNIV OF INFORMATION TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products