Method for realizing quantum circuit design through quantum Fourier transform
A technology of Fourier transform and circuit design, applied in the field of circuit design, can solve the problem of high complexity of electronic circuit design
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0070] A method for realizing quantum circuit design through quantum Fourier transform, comprising the steps of:
[0071] Step 1: Combine quantum computing with classical Fourier transform techniques to obtain quantum Fourier transform.
[0072] The specific process is: Step 1.1: A set of standard orthogonal basis |0>,...,|2 n -1> acts on the ground state |k> to obtain the discrete quantum Fourier transform where k∈{0,1,...,2 n -1}, i is an imaginary unit, n and j are integers;
[0073] Step 1.2: Take the discrete quantum Fourier transform Acting on the quantum state |ψ>, the action process is in is a complex number, i is the imaginary unit, n and j are integers, θ k is a real number;
[0074] Step 1.3: Simplify the result of the action in step 1.2 to obtain the iterative formula of the quantum Fourier transform
[0075]
[0076] where H and I 2 is a single-qubit gate, is the tensor product operation symbol, is a uniform shuffling permutation matrix, ...
Embodiment 2
[0093] A method for realizing quantum circuit design through quantum Fourier transform, comprising the steps of:
[0094] Step 1: Combine quantum computing with classical Fourier transform techniques to obtain quantum Fourier transform.
[0095] The specific process is: Step 1.1: A set of standard orthogonal bases |0>,...,|2 n -1> acts on the ground state |k> to get the discrete quantum Fourier transform where k∈{0,1,…,2 n -1}, i is an imaginary unit, n and j are integers;
[0096] Step 1.2: Take the discrete quantum Fourier transform Acting on the quantum state |ψ>, the action process is in is a complex number, i is the imaginary unit, n and j are integers, θ k is a real number;
[0097] Step 1.3: Simplify the result of the action in step 1.2 to obtain the iterative formula of the quantum Fourier transform
[0098]
[0099] where H and I 2 is a single-qubit gate, is the tensor product operation symbol, is a uniform shuffling permutation matrix, and t...
Embodiment 3
[0125] A method for realizing quantum circuit design through quantum Fourier transform, comprising the steps of:
[0126] Step 1: Combine quantum computing with classical Fourier transform techniques to obtain quantum Fourier transform.
[0127] The specific process is: Step 1.1: A set of standard orthogonal bases |0>,...,|2 n -1> acts on the ground state |k> to obtain the discrete quantum Fourier transform where k∈{0,1,...,2 n -1}, i is an imaginary unit, n and j are integers;
[0128] Step 1.2: Take the discrete quantum Fourier transform Acting on the quantum state |ψ>, the action process is in is a complex number, i is the imaginary unit, n and j are integers, θ k is a real number;
[0129] Step 1.3: Simplify the result of the action in step 1.2 to obtain the iterative formula of the quantum Fourier transform
[0130]
[0131] where H and I 2 is a single-qubit gate, is the tensor product operation symbol, is a uniform shuffling permutation matrix, ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com