pyQPanda

• 1 Basic Introduction
  • 1.1 System configuration
  • 1.2 Download pyqpanda
• 2 Advanced Quantum programming
  • 2.1 Quantum logic gate
    • 2.1.1 Matrix form of common quantum logic gates
      • 2.1.1.1 Single-qubit quantum logic gate
      • 2.1.1.2 Multi-qubit quantum logic gates
    • 2.1.2 Interface introduction
    • 2.1.3 Example
  • 2.2 Quantum circuit
    • 2.2.1 Quantum algorithm circuit diagram
    • 2.2.2 Interface introduction
    • 2.2.3 Example
  • 2.3 QWhile
    • 2.3.1 Interface introduction
    • 2.3.2 Example
  • 2.4 QIf
    • 2.4.1 Interface introduction
    • 2.4.2 Example
  • 2.5 Quantum program
    • 2.5.1 Interface introduction
    • 2.5.2 Example
  • 2.6 Quantum simulator
    • 2.6.1 Full-amplitude quantum simulator
      • 2.6.1.1 Interface introduction
      • 2.6.1.2 Example 1
      • 2.6.1.3 Example 2
    • 2.6.2 Noise inclusive quantum simulator
      • 2.6.2.1 Introduction to noise models
        • (1) DAMPING_KRAUS_OPERATOR
        • (2) DEPHASING_KRAUS_OPERATOR
        • (3) DECOHERENCE_KRAUS_OPERATOR
        • (4) DEPOLARIZING_KRAUS_OPERATOR
        • (5) BITFLIP_KRAUS_OPERATOR
        • (6) BIT_PHASE_FLIP_OPRATOR
        • (7) PHASE_DAMPING_OPRATOR
        • (8) DOULE-GATE NOISE MODEL
      • 2.6.2.2 Interface introduction
      • 2.6.2.3 Example
    • 2.6.3 Single-amplitude quantum simulator
      • 2.6.3.1 Instructions
    • 2.6.4 Partial-amplitude quantum simulator
      • 2.6.4.1 Instructions
    • 2.6.5 Tensor network quantum simulator
      • 2.6.5.1 Applications
      • 2.6.5.2 Instructions
      • 2.6.5.3 Complete example code
  • 2.7 Qubit pool
    • 2.7.1 Introduction
    • 2.7.2 Interface description
    • 2.7.3 Example
  • 2.8 Quantum measurement
    • 2.8.1 Interface introduction
    • 2.8.2 Example
  • 2.9 Probability measurement
    • 2.9.1 Interface introduction
    • 2.9.2 Example
  • 2.10 OriginQ Cloud service
    • 2.10.1 Real chip computing service
      • 2.10.1.1 Origin Wuyuan superconducting chip
    • 2.10.2 Origin high-performance computing cluster cloud service
      • 2.10.2.1 Full-amplitude simulation cloud computing
      • 2.10.2.2 Partial-amplitude simulation cloud computing
      • 2.10.2.3 Single-amplitude cloud computing
      • 2.10.2.4 Noise simulation cloud computing
      • 2.10.2.5 Get the quantum state tomography results
• 3 Quantum program information
  • 3.1 NodeIter
    • 3.1.1 Interface introduction
    • 3.1.2 Example
  • 3.2 Logic gate statistics
    • 3.2.1 Introduction
    • 3.2.2 Interface introduction
    • 3.2.3 Example
  • 3.3 Counting quantum program clock cycle
    • 3.3.1 Introduction
    • 3.3.2 Interface introduction
    • 3.3.3 Example
  • 3.4 Get the corresponding matrix of the quantum circuit
    • 3.4.1 Example
  • 3.5 Judge whether quantum logic gate matches with the quantum topology
    • 3.5.1 Interface introduction
  • 3.6 Get adjacent quantum logic gates at the designated position.
    • 3.6.1 Example
  • 3.7 Judge whether two quantum logic gates are interchanged for their positions
    • 3.7.1 Example
  • 3.8 Judge whether the logic gates are of a set of quantum logic gates supported by the quantum chip
  • 3.9 Character drawing of quantum circuit
    • 3.9.1 Example
  • 3.10 Quantum volume
    • 3.10.1 Introduction
    • 3.10.2 Interface description
    • 3.10.3 Example
  • 3.11 Random benchmark
    • 3.11.1 Introduction
    • 3.11.2 Interface description
    • 3.11.3 Example
  • 3.12 Cross-entropy benchmark
    • 3.12.1 Introduction
    • 3.12.2 Interface description
    • 3.12.3 Example
• 4 Compiling of quantum program
  • 4.1 Conversion of QASM by a quantum program
    • 4.1.1 QASM introduction
    • 4.1.2 Example
  • 4.2 Conversion into a quantum program by QASM
    • 4.2.1 QASM introduction
    • 4.2.2 Example
  • 4.3 Conversion into Quil by a quantum program
    • 4.3.1 Introduction
    • 4.3.2 Interface introduction
    • 4.3.3 Example
  • 4.4 Serialization of quantum programs
    • 4.4.1 Introduction
    • 4.4.2 Interface introduction
    • 4.4.3 Example
  • 4.5 Parse quantum program binary files
    • 4.5.1 Introduction
    • 4.5.2 Interface introduction
    • 4.5.3 Example
  • 4.6 Conversion into a quantum program by OriginIR
    • 4.6.1 OriginIR
    • 4.6.2 Example
  • 4.7 Conversion of OriginIR by a quantum program
    • 4.7.1 OriginIR introduction
      • 4.7.1.1 Qubit
      • 4.7.1.2 Classical register
      • 4.7.1.3 Quantum logic gate
      • 4.7.1.4 Transposed conjugate operation
      • 4.7.1.5 Adding control qubit operation
      • 4.7.1.6 QIF
      • 4.7.1.7 QWHILE
      • 4.7.1.8 Classical expression
      • 4.7.1.9 MEASURE operation
      • 4.7.1.10 RESET operation
      • 4.7.1.11 BARRIER operation
      • 4.7.1.12 QGATE operation
      • 4.7.1.13 OriginIR program example
    • 4.7.2 Example
  • 4.8 Quantum program matching topology
    • 4.8.1 Interface description
    • 4.8.2 Example
• 5 Utility tool
  • 5.1 Quantum circuit query and replacement
    • 5.1.1 Introduction to interface used
    • 5.1.2 Example
  • 5.2 Filling QProg by gate I
    • 5.2.1 Example
  • 5.3 Unitary matrix decomposition
    • 5.3.1 Objective of algorithm
    • 5.3.2 Overview of algorithm
    • 5.3.3 Instructions
    • 5.3.4 Example
• 6 Component
  • 6.1 Class of Pauli operators
    • 6.1.1 Interface introduction
    • 6.1.2 Example
  • 6.2 Class of Fermionic operators
    • 6.2.1 Example
  • 6.3 Optimization algorithm (direct search)
    • 6.3.1 Interface introduction
    • 6.3.2 Example
• 7 VQC
  • 7.1 Variable
    • 7.1.1 Interface introduction
    • 7.1.2 Example
  • 7.2 Operator
  • 7.3 Variational quantum logic gate
    • 7.3.1 Interface introduction
    • 7.3.2 Example
  • 7.4 Variational quantum logic gate (VQG)
    • 7.4.1 Interface introduction
    • 7.4.2 Dynamic modification of parameters
      • 7.4.2.1 Example:
  • 7.5 Optimization algorithm (gradient descent)
    • 7.5.1 Interface introduction
    • 7.5.2 Example
  • 7.6 Comprehensive example
    • 7.6.1 QAOA
• 8 Basis of quantum algorithm
  • 8.1 Review of basic concepts
    • 8.1.1 Basic definitions
    • 8.1.2 pyQPanda interface function
    • 8.1.3 Example
  • 8.2 Experimental state preparation and quantum entanglement
    • 8.2.1 Experimental state preparation
      • 8.2.1.1 Maximum superposition state
    • 8.2.2 Quantum entanglement
    • 8.2.3 Maximum superposition state preparation
  • 8.3 Hadamard Test and SWAP Test
    • 8.3.1 Hadamard Test
      • 8.3.1.1 Output results and generalization
      • 8.3.1.2 Code example
    • 8.3.2 SWAP Test
      • 8.3.2.1 Code example
  • 8.4 Amplitude magnification
    • 8.4.1 Background of algorithm
    • 8.4.2 Code example
  • 8.5 Quantum Fourier transform
    • 8.5.1 Basic definition
    • 8.5.2 Construction of quantum circuit
      • 8.5.2.1 Sum form and tensor product form of QFT
      • 8.5.2.2 Binary expansion and quantum state preparation
    • 8.5.3 Code implementation
  • 8.6 Quantum phase estimation
    • 8.6.1 Overview of structure of quantum circuit
    • 8.6.2 Construction of quantum circuit
      • 8.6.2.1 Eigen quantum state and eigenvalue phase extraction
      • 8.6.2.2 Transfer of eigenvalue phase from amplitude to base vector
    • 8.6.3 Quantum circuit diagram and code implementation
  • 8.7 For operations of quantum
    • 8.7.1 Background of adder algorithm
      • 8.7.1.1 Component of MAJ quantum circuit
      • 8.7.1.2 Component of UMA quantum circuit
    • 8.7.2 For operations of quantum
      • 8.7.2.1 Quantum adder
      • 8.7.2.2 Quantum subtracter
      • 8.7.2.3 Quantum multiplier
      • 8.7.2.4 Quantum divider
    • 8.7.3 Code implementation and use instructions
      • 8.7.3.1 Quantum adder
      • 8.7.3.2 Quantum subtracter
      • 8.7.3.3 Quantum multiplier
      • 8.7.3.4 Quantum divider
    • 8.7.4 Example
  • 8.8 HHL algorithm
    • 8.8.1 Overview of background
    • 8.8.2 Principle of algorithm
      • 8.8.2.1 Extraction of eigenvalue through QPE
      • 8.8.2.2 Transfer of eigenvalue through controlled rotation
      • 8.8.2.3 Output of resulting quantum state through inverse QPE
    • 8.8.3 Quantum circuit diagram and reference code
  • 8.9 Grover algorithm and Quantum Counting algorithm
    • 8.9.1 Overview of background
      • 8.9.1.1 Quantum Counting
      • 8.9.1.2 Search for solution elements
    • 8.9.2 Principle of algorithm
      • 8.9.2.1 QPE process based on amplitude amplification operator
  • 8.10 Shor’s Algorithm
    • 8.10.1 Background of problem
    • 8.10.2 Principle of algorithm
      • 8.10.2.1 Pre-lemma
      • 8.10.2.2 Construction of modular multiplication quantum gate
      • 8.10.2.3 Solving of modular exponentiation inverse element
    • 8.10.3 Quantum circuit diagram and reference code
  • 8.11 Quantum imaginary time evolution
    • 8.11.1 Overview of background
    • 8.11.2 Principle of algorithm
      • 8.11.2.1 Approximate solution from Schrodinger Equation to differential equation
      • 8.11.2.2 Imaginary time evolution approaching ground state
    • 8.11.3 Quantum circuit diagram and reference code