Partial Quantum Circuit Synthesis for Connectivity-Constrained Compilation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current quantum computing methods require complex analysis and synthesis of large output quantum circuits to comply with connectivity constraints, leading to increased computational expense and a higher number of quantum gates in the output circuit.
Innovation Solution
A quantum computing compiling method that iteratively processes input quantum gates, updating a synthesizable accumulated operator and synthesizing partial quantum sub-circuits only when necessary, to reduce the number of quantum gates in the output circuit while maintaining compliance with quantum computer constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If quantum computer compliant synthesis is performed on large output quantum circuits, then the output circuit complies with connectivity constraints, but the computational expense increases
Solution Approach 1:
The patent segments the quantum circuit synthesis process into iterative steps, processing quantum gates in execution order and synthesizing only the necessary portion of the accumulated operator at each step. This avoids the need to analyze and synthesize the entire large output circuit upfront, thereby reducing computational expense while maintaining compliance with connectivity constraints.
Solution Approach 2:
The patent applies partial synthesis by updating a synthesizable accumulated operator iteratively and synthesizing only when necessary, rather than performing complete synthesis on the entire circuit. This partial action approach reduces computational resources required while still achieving the necessary compliance with quantum computer constraints.
2Reliability
If complete quantum computer compliant synthesis is performed, then the output circuit is fully compliant, but the number of quantum gates in the output circuit increases
Solution Approach 1:
By segmenting the synthesis process into iterative updates of the accumulated operator, the patent identifies and synthesizes only the minimal necessary quantum gates at each step. This prevents unnecessary gate insertions that would increase circuit complexity while still ensuring full compliance with connectivity constraints in the final output.
Solution Approach 2:
The patent performs partial synthesis only when the accumulated operator requires it, rather than applying complete synthesis throughout. This selective approach minimizes the number of quantum gates in the output circuit while maintaining necessary compliance with quantum computer connectivity constraints.
Data Source
AI summary
The present disclosure relates to a compiling method (50) for converting an input quantum circuit into an output quantum circuit compliant with predetermined constraints of a quantum computer, said input quantum circuit being composed of quantum gates to be applied to a set of qubits, said quantum gates arranged successively in an execution order, wherein said method comprises, for each quantum gate of the input quantum circuit processed according to the execution order:if the processed quantum gate corresponds to an operator of a set of synthesizable operators: (S53) update the synthesizable accumulated operator to include the operator corresponding to the quantum gate,otherwise: a) (S54) synthesize a partial quantum sub-circuit partially implementing the current synthesizable accumulated operator and modify accordingly the synthesizable accumulated operator, and b) (S55) append the partial quantum sub-circuit to the output quantum circuit.