CN107025206A - A kind of method that quantum Fourier transform realizes quantum wire design - Google Patents
A kind of method that quantum Fourier transform realizes quantum wire design Download PDFInfo
- Publication number
- CN107025206A CN107025206A CN201710238867.4A CN201710238867A CN107025206A CN 107025206 A CN107025206 A CN 107025206A CN 201710238867 A CN201710238867 A CN 201710238867A CN 107025206 A CN107025206 A CN 107025206A
- Authority
- CN
- China
- Prior art keywords
- quantum
- fourier transform
- formula
- quantum fourier
- realizes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- General Physics & Mathematics (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Theoretical Computer Science (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Complex Calculations (AREA)
Abstract
The present invention provides a kind of method that quantum Fourier transform realizes quantum wire design, belong to circuit design field, because existing quantum Fourier transform realizes that circuit has all lacked bit flipping (Bit Reverse) circuit, the present invention is that improving and improvement for technology is realized to existing quantum Fourier transform.The present invention is using the tensor product and basic quantum bit door (including the controlled door of quantum bit and single quantum bit door) of extension, and 4 quantum Fourier transforms are constructed respectively realizes circuit.From quantum Fourier transform realize network complexity analysis it was found from, for one 2nThe data set of individual element, the complexity of the circuit of 4 quantum Fourier transforms is all Θ (n2), this is that other classical FFTs are unable to reach.The present invention is applied to much actual information processing application fields, for example, the compression of image, denoising, encryption and decryption scheduling algorithm are required for efficient Fourier transform, and the popularization that quantum calculation theory is improved and applied is of great importance.
Description
Technical field
Specifically it is to be related to a kind of quantum Fourier transform to realize quantum wire the present invention relates to circuit design field
The method of design.
Background technology
Quantum calculation is the product that quantum mechanics and computer science are combined, the concurrency of quantum calculation, additivity and
Its uncertainty measured is that quantum computer is basic better than classic computer.In face of such advantage, quantum information processing
Research just seems necessary, and it turns into countries in the world Strategic Competition focus, and Quantum fourier transform is quantum information processing
Core algorithm.For example, in big number prime factorization quantum algorithm and Grover quantum search algorithms, at Quantum fourier transform
In key core status.
In traditional counting, information unit represents that it only has two states with bit (Bit)：0 state or 1 state.In quantum meter
In calculation, information unit with quantum bit (Qubit) represent, it has two basic quantum states | 0 ＞ with | 1>, basic quantum state is referred to as
For ground state (Basis State).One quantum bit can be the linear combination of two ground state, be commonly referred to as superposition state
(Superposition), it is represented by | ψ>=a | 0 ＞+b | 1>.Wherein a and b are two plural numbers, are met | a |2+|b|2=1, because
This is also referred to as probability amplitude.
Tensor product (tensorproduct) is to be combined small vector space, constitutes one kind of bigger vector space
Method, uses symbolRepresent, it has following implication：
Assuming that it is two complex matrix of m × m that U, which is n × n and V,
So
Assuming that two unitary matrice collection are combined into：WithIn have m n × n matrix, In have n m × m matrix.The tensor product of extension is mn × mn matrixWherein
WhenIn each matrix it is identical, Ai=A, nowIt can be write asIf simultaneouslyIn it is every
The all identical B of individual matrixi=B, the tensor product at this moment extendedIt is degenerated to common tensor product
In quantum calculation, a quantum state can be defined as follows with a vector of Hilbert space come list notation
Wherein []TIt is matrix transposition computing.For two ground state | u>With | v>, their tensor productConventional contracting
Write symbol | uv ＞, | u ＞ | v ＞ or | u, v ＞ are represented, such as ground state | 0>With | 1 ＞, their tensor product is represented by
For n tensor product of matrix UIt can write a Chinese character in simplified form intoFor quantum state | u>N tensor productAlso it can write a Chinese character in simplified form into
If a quantized system is made up of n quantum bits, this quantized system has 2nIndividual mutually orthogonal ground state |
i1i2...in>,i1,i2,...,in∈ { 0,1 }, this 2nIndividual ground state Zhang Chengyi 2nTie up Hilbert spaces, then the quantized system
State is represented by
Wherein i=inin-1...i1It is integer i binary expansion, and meets normalizing condition
Quantum wire can be made up of the quantum bit door of a sequence, in the expression figure of quantum wire, every line all tables
Show the line of quantum wire, the execution sequence of quantum wire is from left to right.Quantum bit door can be conveniently with matrix form
Represent, single quantum bit door can represent that i.e. U+U=I, wherein U+ are U conjugate transposition squares with the unitary matrice U of one 2 × 2
Battle array, I is unit matrix.Double quantum bits door in, it is most important be it is controlled U, U is the unitary matrice of one any 2 × 2, and it has two
The bit input and output of individual quantum, are control quantum bit and target quantum bit respectively.Some basic quantum bit gates
Title, symbol and corresponding matrix represent to see Fig. 1.
Pn,mIt is mn × mn perfect shuffle permutation matrix, (Pn,m)k,l=δv,z'δz,v', wherein k=vn+z, l=v'm+
Z', 0≤v, z'＜ m, 0≤v', z ＜ n, as x ≠ y, δx,y=0, no person δx,y=1.
WithIt is two special perfect shuffle permutation matrixes, their recursion equation is：
Wherein Swap is the swap gate shown in Fig. 1,Quantum realize circuit as shown in Fig. 2Quantum it is real
Existing circuit is as shown in Figure 3.
Because the complexity for realizing electronic circuitry design of existing classical FFT is Θ (n2n), than
It is more complicated, the demand of society could not be met very well.Therefore need to design the lower side for realizing electronic circuitry design of complexity
Method.
The content of the invention
The present invention provides a kind of method that quantum Fourier transform realizes quantum wire design, solves existing classical quick
The problem of complexity for realizing electronic circuitry design of Fourier transform is high
The present invention solves the above problems by the following technical programs：
A kind of method that quantum Fourier transform realizes quantum wire design,
Comprise the following steps：
Step 1：Quantum calculation is combined with classical fourier transform technique and obtains quantum Fourier transform；
Step 2：Quantum Fourier transform is carried out formula computing and obtains quantum Fourier transform formula；
Step 3：Quantum Fourier transform formula is designed quantum Fourier transform circuit according to tensor product principle of operation
Figure.
In such scheme, preferably in step 1 quantum calculation with classical fourier transform technique be combined it is specific
Process is：
Step 1.1：The orthogonal basis of one group of standard | 0>,...,|2n-1>Act on ground state | k>On obtain discrete quantum Fourier
Leaf transformation Wherein k ∈ 0,1 ..., 2n- 1 }, i is imaginary unit, and n and j are integers；
Step 1.2：Discrete quantum Fourier transformAct on quantum state | ψ>On, its mechanism isWhereinIt is a plural number, i is imaginary unit, and n and j are integer, θkIt is one
Individual real number；
Step 1.3：Exercising result in abbreviation step 1.2 obtains the iterative formula of quantum Fourier transform
Wherein H and I2It is single quantum bit door,It is tensor product oeprator, It is uniformly to shuffle
Permutation matrix, iteration initial value isRnFor spin matrix, RnExpression formula be：
Wherein, π is pi, and i is imaginary unit, and n is an integer.
In such scheme, preferably the process of formula computing is in step 2：
Step 2.1：Set up intermediate functionExpression formula be：
Wherein, I2For single quantum bit door,RnFor spin matrix；
Step 2.2：To functionComputing is carried out, so as to obtain：
Wherein,<1 | be ground state ＜ 1 | conjugate transposition, iteration initial value is
Step 2.3：The intermediate function of abbreviationThe quantum Fourier transform substituted into step 1.3
Iterative formulaIn obtain quantum Fourier transform formula：
Advantages of the present invention is with effect：
1st, of the invention compared with existing quantum Fourier transform realizes technology, the present invention utilizes the tensor product and amount extended
It is that one kind of existing quantum Fourier transform technology is innovated that sub- bit gate, which is realized in quantum Fourier transform, method,.
2nd, of the invention compared with existing quantum Fourier transform realizes technology, the present invention devises 4 complete quantum
Fourier transform realizes circuit, and existing quantum Fourier transform realizes that circuit has all lacked bit flipping (Bit
Reverse) circuit, is that improving and improvement for technology is realized to existing quantum Fourier transform.
3rd, the present invention is compared with classical Fourier transform realizes technology, quantum Fu that the present invention is realized using quantum wire
Vertical leaf transformation is a kind of efficient transform method, and 4 quantum Fourier transforms realize that network complexity is all Θ (n2), and pass through
The implementation complexity of the FFT of allusion quotation is Θ (n2n)。
Brief description of the drawings
Fig. 1 is the expression figure of fundamental quantity cervical orifice of uterus of the present invention and homography；
Fig. 2 is the present inventionQuantum realize line map；
Fig. 3 is the present inventionQuantum realize line map；
Fig. 4 realizes circuit for the quantum Fourier transform of the embodiment of the present invention 1；
Fig. 5 realizes circuit for the quantum Fourier transform of the embodiment of the present invention 2；
Fig. 6 realizes circuit for the quantum Fourier transform of the embodiment of the present invention 3；
Fig. 7 realizes circuit for the quantum Fourier transform of the embodiment of the present invention 4；
Fig. 8 realizes circuit for the quantum Fourier transform in the embodiment of the present invention 1 during n=3；
Fig. 9 realizes circuit for the quantum Fourier transform in the embodiment of the present invention 2 during n=3；
Figure 10 realizes circuit for the quantum Fourier transform in the embodiment of the present invention 3 during n=3；
Figure 11 realizes circuit for the quantum Fourier transform in the embodiment of the present invention 4 during n=3.
Embodiment
The invention will be further described with reference to embodiments.
Embodiment 1：
A kind of method that quantum Fourier transform realizes quantum wire design, comprises the following steps：
Step 1：Quantum calculation is combined with classical fourier transform technique and obtains quantum Fourier transform.
Detailed process is：Step 1.1：The orthogonal basis of one group of standard | 0 ＞ ..., | 2n- 1 ＞ acts on ground state | on k ＞
To discrete quantum Fourier transform Wherein k ∈ 0,1 ..., 2n- 1 }, i is imaginary unit,
N and j are integers；
Step 1.2：Discrete quantum Fourier transformAct on quantum state | ψ>On, its mechanism isWhereinIt is a plural number, i is imaginary unit, and n and j are integer, θkIt is one
Individual real number；
Step 1.3：Exercising result in abbreviation step 1.2 obtains the iterative formula of quantum Fourier transform
Wherein H and I2It is single quantum bit door,It is tensor product oeprator, It is uniformly to shuffle
Permutation matrix, iteration initial value isRnFor spin matrix, RnExpression formula be：
Wherein, π is pi, and i is imaginary unit, and n is an integer.
Step 2：Quantum Fourier transform is carried out formula computing and obtains quantum Fourier transform formula.
Detailed process is：Step 2.1：Set up intermediate function Expression formula be：
Wherein, I2For single quantum bit door,RnFor spin matrix.
Step 2.2：To functionComputing is carried out, so as to obtain：
Wherein,<1 | it is ground state<1 | conjugate transposition, iteration initial value is
Step 2.3：The intermediate function of abbreviationThe iterative formula of the quantum Fourier transform substituted into step 1.3In obtain quantum Fourier transform formula：
Step 3：Quantum Fourier transform formula is designed quantum Fourier transform circuit according to tensor product principle of operation
Figure, as shown in Figure 4.Single quantum bit door and double quantum bits door that the complexity of quantum wire refers to build quantum wire are total
Quantity.So as to design as shown in figure 4, the complexity of quantum wire is Θ (n2)
N=3 is substituted into formula (1), first quantum Fourier transform that the present invention is designed is obtained
Realize circuit as shown in figure 8, during n=3, the complexity of quantum wire is 6.
Embodiment 2：
A kind of method that quantum Fourier transform realizes quantum wire design, comprises the following steps：
Step 1：Quantum calculation is combined with classical fourier transform technique and obtains quantum Fourier transform.
Detailed process is：Step 1.1：The orthogonal basis of one group of standard | 0>,...,|2n-1>Act on ground state | k>On obtain
Discrete quantum Fourier transform Wherein k ∈ 0,1 ..., 2n- 1 }, i is imaginary unit, n and
J is integer；
Step 1.2：Discrete quantum Fourier transformAct on quantum state | ψ>On, its mechanism isWhereinIt is a plural number, i is imaginary unit, and n and j are integer, θkIt is one
Individual real number；
Step 1.3：Exercising result in abbreviation step 1.2 obtains the iterative formula of quantum Fourier transform
Wherein H and I2It is single quantum bit door,It is tensor product oeprator, It is uniformly to shuffle
Permutation matrix, iteration initial value isRnFor spin matrix, RnExpression formula be：
Wherein, π is pi, and i is imaginary unit, and n is an integer.
Step 2：To the iterative formula of quantum Fourier transformTransform operation is carried out, quantum Fourier transform is obtained
Iteration formula
Step 2.1：The detailed process of inverse operation is：
Wherein, ()-1It is inversion operation.
Step 2.2：The iteration formula of quantum Fourier transform is obtained after being handled according to step 2.1 inverse operationSpecific table
Up to formula：
Wherein H and I2It is single quantum bit door,It is tensor product oeprator,
It is perfect shuffle permutation matrix, iteration initial value isRnFor spin matrix, RnExpression formula be：
Wherein, π is pi, and i is imaginary unit, and n is an integer.
Step 2.3：Set up intermediate functionExpression formula be：
Wherein, I2For single quantum bit door,RnFor spin matrix；
Step 2.4：To functionComputing is carried out, so as to obtain：
Wherein,<1 | it is ground state<1 | conjugate transposition, iteration initial value is
Step 2.5：The intermediate function of abbreviationThe iterative formula of the quantum Fourier transform substituted into step 2.2In obtain quantum Fourier transform formula：
Step 3：Quantum Fourier transform formula is designed quantum Fourier transform circuit according to tensor product principle of operation
Figure, as shown in Figure 5.Single quantum bit door and double quantum bits door that the complexity of quantum wire refers to build quantum wire are total
Quantity.So as to design as shown in figure 5, the complexity of quantum wire is Θ (n2)。
N=3 is substituted into the iteration formula of quantum Fourier transformObtain quantum Fourier transform
Realize circuit as shown in figure 9, the complexity of quantum wire is 6.
Embodiment 3：
A kind of method that quantum Fourier transform realizes quantum wire design, comprises the following steps：
Step 1：Quantum calculation is combined with classical fourier transform technique and obtains quantum Fourier transform.
Detailed process is：Step 1.1：The orthogonal basis of one group of standard | 0>,...,|2n- 1 ＞ acts on ground state | on k ＞
To discrete quantum Fourier transform Wherein k ∈ 0,1 ..., 2n- 1 }, i is imaginary unit,
N and j are integers；
Step 1.2：Discrete quantum Fourier transformAct on quantum state | ψ>On, its mechanism isWhereinIt is a plural number, i is imaginary unit, and n and j are integer, θkIt is one
Individual real number；
Step 1.3：Exercising result in abbreviation step 1.2 obtains the iterative formula of quantum Fourier transform
Wherein H and I2It is single quantum bit door,It is tensor product oeprator, It is uniformly to shuffle
Permutation matrix, iteration initial value isRnFor spin matrix, RnExpression formula be：
Wherein, π is pi, and i is imaginary unit, and n is an integer.
Step 2：To the iterative formula of quantum Fourier transformTransform operation is carried out, quantum Fourier transform is obtained
Iteration formula
Step 2.1：The detailed process of inverse operation is：
Wherein, ()-1It is inversion operation.
Step 2.2：The iteration formula of quantum Fourier transform is obtained after being handled according to step 2.1 inverse operationIt is specific
Expression formula：
Wherein H and I2It is single quantum bit door,It is tensor product oeprator, It is uniformly to shuffle
Permutation matrix, iteration initial value isRnFor spin matrix, RnExpression formula be：
Wherein, π is pi, and i is imaginary unit, and n is an integer.
Step 3：Set up intermediate functionWhereinExpression formula be：
Step 4：To intermediate functionHandled, concrete processing procedure is：
Wherein,<1 | be ground state ＜ 1 | conjugate transposition,Iteration initial value is：
Step 5：Intermediate function intermediate functionSubstitute into the iteration formula of quantum Fourier transformIn the amount of obtaining
The iteration formula of sub- Fourier transform
Wherein, H and I2It is single quantum bit door,It is tensor product oeprator, It is uniformly to shuffle
Permutation matrix, iteration initial value isRnFor spin matrix.
Step 6：Quantum Fourier transform formula is designed quantum Fourier transform circuit according to tensor product principle of operation
Figure, as shown in Figure 6.Single quantum bit door and double quantum bits door that the complexity of quantum wire refers to build quantum wire are total
Quantity.So as to design as shown in fig. 6, the complexity of quantum wire is Θ (n2)。
N=3 is substituted into the iteration formula of quantum Fourier transformIn, obtain quantum Fourier transform
Realize circuit as shown in Figure 10, the complexity of quantum wire is 6.
Embodiment 4：
A kind of method that quantum Fourier transform realizes quantum wire design, comprises the following steps：
Step 1：Quantum calculation is combined with classical fourier transform technique and obtains quantum Fourier transform.
Detailed process is：Step 1.1：The orthogonal basis of one group of standard | 0 ＞ ..., | 2n- 1 ＞ acts on ground state | k>Upper
To discrete quantum Fourier transform Wherein k ∈ 0,1 ..., 2n- 1 }, i is imaginary unit,
N and j are integers；
Step 1.2：Discrete quantum Fourier transformActing on quantum state | on ψ ＞, its mechanism isWhereinIt is a plural number, i is imaginary unit, and n and j are integer, θkIt is one
Individual real number；
Step 1.3：Exercising result in abbreviation step 1.2 obtains the iterative formula of quantum Fourier transform
Wherein H and I2It is single quantum bit door,It is tensor product oeprator, It is uniformly to shuffle
Permutation matrix, iteration initial value isRnFor spin matrix, RnExpression formula be：
Wherein, π is pi, and i is imaginary unit, and n is an integer.
Step 2：Set up intermediate functionWhereinExpression formula be：
Step 4：To intermediate functionHandled, concrete processing procedure is：
Wherein,<1 | it is ground state<1 | conjugate transposition,Iteration initial value is：
Step 3：To the iterative formula of the quantum Fourier transform in step 1.3Transposition computing is carried out, so that the amount of obtaining
The iteration formula of sub- Fourier transformExpression：
Wherein, H and I2It is single quantum bit door,It is tensor product oeprator, It is uniformly to shuffle
Permutation matrix, iteration initial value isRnFor spin matrix,.
Step 4：Iteration formula to substitute into quantum of action Fourier transformSo as to obtain：
Wherein, H and I2It is single quantum bit door,It is tensor product oeprator, It is uniformly to shuffle
Permutation matrix, iteration initial value isRnFor spin matrix.
Step 5：Quantum Fourier transform formula is designed quantum Fourier transform circuit according to tensor product principle of operation
Figure, as shown in Figure 7.Single quantum bit door and double quantum bits door that the complexity of quantum wire refers to build quantum wire are total
Quantity.So as to design as shown in fig. 7, the complexity of quantum wire is Θ (n2)。
N=3 is substituted into the iteration formula of quantum Fourier transformIn, obtain quantum Fourier transform
Realize circuit as shown in figure 11, the complexity of quantum wire is 6.
The preferred embodiment to the invention is illustrated above, but the present invention is not limited to embodiment,
Those skilled in the art can also make a variety of equivalent modifications on the premise of without prejudice to the invention spirit
Or replace, these equivalent modifications or replacement are all contained in scope of the present application.
Claims (3)
1. a kind of method that quantum Fourier transform realizes quantum wire design, it is characterised in that：Comprise the following steps：
Step 1：Quantum calculation is combined with classical fourier transform technique and obtains quantum Fourier transform；
Step 2：Quantum Fourier transform is carried out formula computing and obtains quantum Fourier transform formula；
Step 3：Quantum Fourier transform formula is designed quantum Fourier transform line map according to tensor product principle of operation.
2. the method that a kind of quantum Fourier transform according to claim 1 realizes quantum wire design, it is characterised in that：
It is with the detailed process that classical fourier transform technique is combined quantum calculation in the step 1：
Step 1.1：The orthogonal basis of one group of standard | 0>,...,|2n-1>Act on ground state | k>On obtain discrete quantum Fourier change
Change Wherein k ∈ 0,1 ..., 2n- 1 }, i is imaginary unit, and n and j are integers；
Step 1.2：Discrete quantum Fourier transformAct on quantum state | ψ>On, its mechanism isWhereinIt is a plural number, i is imaginary unit, and n and j are integer, θkIt is
One real number；
Step 1.3：Exercising result in abbreviation step 1.2 obtains the iterative formula of quantum Fourier transform
Wherein H and I2It is single quantum bit door,It is tensor product oeprator, It is perfect shuffle permutation
Matrix, iteration initial value isRnFor spin matrix, RnExpression formula be：
Wherein, π is pi, and i is imaginary unit, and n is an integer.
3. the method that a kind of quantum Fourier transform according to claim 1 realizes quantum wire design, it is characterised in that：
The process of formula computing is in the step 2：
Step 2.1：Set up intermediate functionExpression formula be：
Wherein, I2For single quantum bit door,RnFor spin matrix；
Step 2.2：To functionComputing is carried out, so as to obtain：
Wherein,<1 | it is ground state<1 | conjugate transposition, iteration initial value is
Step 2.3：The intermediate function of abbreviationThe iterative formula of the quantum Fourier transform substituted into step 1.3In
Obtain quantum Fourier transform formula：
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710238867.4A CN107025206B (en) | 2017-04-13 | 2017-04-13 | Method for realizing quantum circuit design by quantum Fourier transform |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710238867.4A CN107025206B (en) | 2017-04-13 | 2017-04-13 | Method for realizing quantum circuit design by quantum Fourier transform |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107025206A true CN107025206A (en) | 2017-08-08 |
| CN107025206B CN107025206B (en) | 2020-06-19 |
Family
ID=59527530
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710238867.4A Expired - Fee Related CN107025206B (en) | 2017-04-13 | 2017-04-13 | Method for realizing quantum circuit design by quantum Fourier transform |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107025206B (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108416445A (en) * | 2018-03-13 | 2018-08-17 | 广西师范大学 | A kind of design method that the storage of quantum real signal is realized with quantum wire |
| CN108710951A (en) * | 2018-05-17 | 2018-10-26 | 合肥本源量子计算科技有限责任公司 | A kind of method and system of structure quantum wire |
| CN108898228A (en) * | 2018-06-21 | 2018-11-27 | 广西师范大学 | A kind of quantum adder designs method for not destroying source operand |
| CN108932388A (en) * | 2018-07-10 | 2018-12-04 | 华东交通大学 | A kind of mould 2 based on quantum superposition statenSubtracter design method |
| CN108984849A (en) * | 2018-06-21 | 2018-12-11 | 广西师范大学 | A kind of quantum comparison device design method based on quantum superposition state |
| CN109409526A (en) * | 2018-10-15 | 2019-03-01 | 合肥本源量子计算科技有限责任公司 | A kind of calibration method of list quantum logic door operation |
| CN109741627A (en) * | 2019-02-26 | 2019-05-10 | 湖南正维新能源科技有限责任公司 | A kind of shared parking stall data processing system and its method |
| CN110428055A (en) * | 2018-04-27 | 2019-11-08 | 阿里巴巴集团控股有限公司 | Quantum computing method and equipment |
| CN110991648A (en) * | 2019-12-16 | 2020-04-10 | 北京百度网讯科技有限公司 | Gaussian distribution quantum state determination method and device and electronic equipment |
| WO2020077521A1 (en) * | 2018-10-16 | 2020-04-23 | 深圳职业技术学院 | Quantum state search method and apparatus |
| CN111598249A (en) * | 2020-05-19 | 2020-08-28 | 北京百度网讯科技有限公司 | Method, apparatus, classical computer and storage medium for determining approximate quantum gate |
| CN112529812A (en) * | 2020-12-18 | 2021-03-19 | 西安微电子技术研究所 | Remote sensing image denoising method based on quantum Fourier transform |
| WO2022247887A1 (en) * | 2021-05-28 | 2022-12-01 | 合肥本源量子计算科技有限责任公司 | Method and apparatus for constructing quantum circuit corresponding to linear function |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0474246A2 (en) * | 1990-09-06 | 1992-03-11 | Matsushita Electric Industrial Co., Ltd. | Image signal processor |
| EP0696002A2 (en) * | 1994-07-27 | 1996-02-07 | Fujitsu Limited | Two-dimensional discrete cosine transform computing circuit |
| CN101061474A (en) * | 2004-06-10 | 2007-10-24 | 哈桑·塞希托格鲁 | Matrix-valued methods and apparatus for signal processing |
| CN103942753A (en) * | 2014-05-04 | 2014-07-23 | 华东交通大学 | Multi-dimensional quantum colored image geometric transformation design and achieving method |
| CN105450273A (en) * | 2015-08-24 | 2016-03-30 | 电信科学技术研究院 | Methods and apparatuses for transmitting coding indication information and determining precoding matrix |
-
2017
- 2017-04-13 CN CN201710238867.4A patent/CN107025206B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0474246A2 (en) * | 1990-09-06 | 1992-03-11 | Matsushita Electric Industrial Co., Ltd. | Image signal processor |
| EP0696002A2 (en) * | 1994-07-27 | 1996-02-07 | Fujitsu Limited | Two-dimensional discrete cosine transform computing circuit |
| CN101061474A (en) * | 2004-06-10 | 2007-10-24 | 哈桑·塞希托格鲁 | Matrix-valued methods and apparatus for signal processing |
| CN103942753A (en) * | 2014-05-04 | 2014-07-23 | 华东交通大学 | Multi-dimensional quantum colored image geometric transformation design and achieving method |
| CN105450273A (en) * | 2015-08-24 | 2016-03-30 | 电信科学技术研究院 | Methods and apparatuses for transmitting coding indication information and determining precoding matrix |
Non-Patent Citations (2)
| Title |
|---|
| 闻腾: ""量子线路模块化级联运算规则的研究"", 《中国优秀硕士学位论文全文数据库 基础科学辑》 * |
| 黎海生: ""量子图像处理关键技术研究"", 《中国博士学位论文全文数据库 基础科学辑》 * |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108416445B (en) * | 2018-03-13 | 2022-04-29 | 杭州思源信息技术股份有限公司 | Design method for quantum real signal storage and quantum circuit realization |
| CN108416445A (en) * | 2018-03-13 | 2018-08-17 | 广西师范大学 | A kind of design method that the storage of quantum real signal is realized with quantum wire |
| CN110428055A (en) * | 2018-04-27 | 2019-11-08 | 阿里巴巴集团控股有限公司 | Quantum computing method and equipment |
| CN108710951A (en) * | 2018-05-17 | 2018-10-26 | 合肥本源量子计算科技有限责任公司 | A kind of method and system of structure quantum wire |
| CN108898228B (en) * | 2018-06-21 | 2024-03-08 | 广西师范大学 | Quantum adder design method without damaging source operands |
| CN108898228A (en) * | 2018-06-21 | 2018-11-27 | 广西师范大学 | A kind of quantum adder designs method for not destroying source operand |
| CN108984849A (en) * | 2018-06-21 | 2018-12-11 | 广西师范大学 | A kind of quantum comparison device design method based on quantum superposition state |
| CN108984849B (en) * | 2018-06-21 | 2023-12-22 | 深圳万知达科技有限公司 | Quantum comparator design method based on quantum superposition state |
| CN108932388A (en) * | 2018-07-10 | 2018-12-04 | 华东交通大学 | A kind of mould 2 based on quantum superposition statenSubtracter design method |
| CN109409526A (en) * | 2018-10-15 | 2019-03-01 | 合肥本源量子计算科技有限责任公司 | A kind of calibration method of list quantum logic door operation |
| CN109409526B (en) * | 2018-10-15 | 2021-08-10 | 合肥本源量子计算科技有限责任公司 | Calibration method for single quantum logic gate operation |
| WO2020077521A1 (en) * | 2018-10-16 | 2020-04-23 | 深圳职业技术学院 | Quantum state search method and apparatus |
| CN109741627A (en) * | 2019-02-26 | 2019-05-10 | 湖南正维新能源科技有限责任公司 | A kind of shared parking stall data processing system and its method |
| CN110991648A (en) * | 2019-12-16 | 2020-04-10 | 北京百度网讯科技有限公司 | Gaussian distribution quantum state determination method and device and electronic equipment |
| CN110991648B (en) * | 2019-12-16 | 2024-01-23 | 北京百度网讯科技有限公司 | Gaussian distribution quantum state determination method and device and electronic equipment |
| CN111598249A (en) * | 2020-05-19 | 2020-08-28 | 北京百度网讯科技有限公司 | Method, apparatus, classical computer and storage medium for determining approximate quantum gate |
| CN112529812B (en) * | 2020-12-18 | 2022-12-02 | 西安微电子技术研究所 | Remote sensing image denoising method based on quantum Fourier transform |
| CN112529812A (en) * | 2020-12-18 | 2021-03-19 | 西安微电子技术研究所 | Remote sensing image denoising method based on quantum Fourier transform |
| WO2022247887A1 (en) * | 2021-05-28 | 2022-12-01 | 合肥本源量子计算科技有限责任公司 | Method and apparatus for constructing quantum circuit corresponding to linear function |
| US11966815B2 (en) | 2021-05-28 | 2024-04-23 | Origin Quantum Computing Technology (Hefei) Co., Ltd | Method and apparatus for constructing quantum circuit corresponding to linear function |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107025206B (en) | 2020-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107025206A (en) | A kind of method that quantum Fourier transform realizes quantum wire design | |
| Imani et al. | A framework for collaborative learning in secure high-dimensional space | |
| Akleylek et al. | An efficient lattice-based signature scheme with provably secure instantiation | |
| CN107153632A (en) | A kind of method that quantum Haar wavelet transformations realize quantum wire design | |
| Cormode et al. | Small summaries for big data | |
| Talarposhti et al. | A secure image encryption method based on dynamic harmony search (DHS) combined with chaotic map | |
| Anees et al. | Discriminative binary feature learning and quantization in biometric key generation | |
| Mossel et al. | Local algorithms for block models with side information | |
| Zhang et al. | Secure distributed genome analysis for GWAS and sequence comparison computation | |
| Brody et al. | Beyond set disjointness: the communication complexity of finding the intersection | |
| CN107180013A (en) | A kind of method that quantum D (4) wavelet transformation realizes quantum wire design | |
| Basati et al. | DFE: efficient IoT network intrusion detection using deep feature extraction | |
| CN107480636A (en) | Face identification method, system and storage medium based on core Non-negative Matrix Factorization | |
| Wang et al. | Privacy-preserving content-based image retrieval for mobile computing | |
| Ye et al. | A feedback chaotic image encryption scheme based on both bit-level and pixel-level | |
| Wang et al. | Quantum representation of indexed images and its applications | |
| Mu et al. | DCGR: feature extractions from protein sequences based on CGR via remodeling multiple information | |
| Kumar et al. | A GRU and chaos-based novel image encryption approach for transport images | |
| Chamon et al. | Quantum statistical mechanics of encryption: Reaching the speed limit of classical block ciphers | |
| Duranthon et al. | Maximal relevance and optimal learning machines | |
| CN108255784A (en) | Multi-layer quantum D(4)The method that quantum wire design is realized in wavelet package transforms and inverse transformation | |
| Fan et al. | Quantum image encryption based on block geometric and Haar wavelet transform | |
| Liu et al. | A novel image encryption algorithm based on compound-coupled logistic chaotic map | |
| Srivastava et al. | On the learning capabilities of recurrent neural networks: a cryptographic perspective | |
| CN110474769A (en) | A kind of quantum color image encrypting method based on modification direction |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200619 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |