Low-complexity quantum circuit simulation system
A circuit simulation, low-complexity technology, applied in the field of quantum computing, can solve problems such as inability to calculate computing time, unsuitable for simulating quantum circuits, large storage space, etc., and achieve the effect of omitting redundant operations
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0057] Example 1: For q 2 Do the Hadamard door operation.
[0058] Step 1: Establish a mathematical model, use To characterize the operation on the quantum system, at this time the total operation matrix U 0 with the input quantum state |θ> in0 Can be expressed as:
[0059]
[0060]
[0061]
[0062] Step 2: Group the qubits and rearrange the numbers of the qubits:
[0063] According to whether the qubit is a control bit or a controlled bit as a judgment condition, the qubits are grouped, q 1 ,q 3 ,q 4 is the cyclic bit, q 2 for operating bits.
[0064] According to the grouping results, the qubit numbers are rearranged, and the vectors for storing quantum states and the total operation matrix are rearranged according to the numbers. The rearranged quantum state |θ> in1 and the rearranged total operation matrix U 1 as follows:
[0065]
[0066]
[0067] Step 3: Reduce the order of the total operation matrix and calculate the output state
[0068] T...
Embodiment 2
[0095] Example 2: For q1q3, q1 controls the CNOT gate of q3, denoted as CNOT 1,3
[0096] Step 1: Establish a mathematical model, use Characterizing qubit logic gates.
[0097]Step 2: Group the qubits and rearrange the numbers of the qubits: according to whether the qubits are control bits or controlled bits as the judgment condition, group the qubits, q 2 ,q 4 is the cyclic bit, q 1 ,q 3 for operating bits. According to the grouping results, the qubit numbers are rearranged, and the vectors for storing quantum states and the total operation matrix are rearranged according to the numbers. The rearranged quantum state |θ> in1 and the rearranged total operation matrix U 1 as follows:
[0098]
[0099]
[0100] in,
[0101] Step 3: Reduce the order of the total operation matrix and calculate the output state
[0102] Through the new numbering and the form of the operation matrix, the 16*16 matrix can be converted into four 4*4 matrices.
[0103] Next, use the...
Embodiment 3
[0122] Example 3: Do q1q3 control q4 Toffoli gate for q1q3q4, denoted as Toffoli 1,3,4
[0123] Step 1: Establish a mathematical model, use Characterizing qubit logic gates.
[0124] Step 2: Group the qubits and rearrange the numbers of the qubits: according to whether the qubits are control bits or controlled bits as the judgment condition, group the qubits, q 2 is the cyclic bit, q 1 ,q 3 ,q 4 for operating bits. According to the grouping results, the qubit numbers are rearranged, and the vectors for storing quantum states and the total operation matrix are rearranged according to the numbers. The rearranged quantum state |θ> in1 and the total operation matrix U after rearrangement 1 as follows:
[0125]
[0126]
[0127] in,
[0128] Step 3: Reduce the order of the total operation matrix and calculate the output state
[0129] Through the new numbering and the form of the operation matrix, the 16*16 matrix can be converted into two 8*8 matrices.
[0130...
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