Quantum Circuit Synthesis via State Approximation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional quantum computing program generation methods scale exponentially, making them computationally expensive and inefficient, especially for large numbers of qubits.
Innovation Solution
The proposed method involves determining an approximated quantum state and using it for quantum circuit synthesis, decomposing the process into two phases to achieve a numerically efficient scheme that scales polynomially.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional circuit synthesis algorithms are used to generate quantum computing programs, then the program can be generated, but the computational cost scales exponentially with the number of qubits
Solution Approach 1:
The patent segments the quantum circuit synthesis process into two distinct phases: (1) determining an approximated quantum state using a simulation of an input quantum circuit, and (2) determining a quantum circuit that produces the approximated state. This segmentation allows the computationally expensive exact synthesis to be replaced with a more efficient approximation approach, reducing overall computational cost while maintaining acceptable program generation capability.
Solution Approach 2:
The patent creates a copy of the target quantum state in the form of an approximated quantum state. Instead of directly synthesizing the exact target state which requires exponential computational resources, the method uses an approximation of the target state that can be prepared more efficiently, thereby reducing the computational cost while still producing a functional quantum program.
2Use of energy by moving object
If new algorithms are proposed to reduce computational costs, then computational efficiency improves, but the algorithms still scale exponentially with the number of qubits
Solution Approach 1:
The patent changes the fundamental parameter of the synthesis approach by transitioning from exact state preparation to approximate state preparation. By accepting an approximation of the target quantum state rather than the exact state, the algorithm achieves polynomial scaling instead of exponential scaling, fundamentally improving both computational cost and scaling performance.
3Measurement precision
If direct quantum circuit synthesis is performed to generate the target quantum state, then the program is generated with high precision, but the process is computationally expensive
Solution Approach 1:
The patent applies partial action by only synthesizing the quantum circuit to the extent necessary to produce an approximated state rather than the exact target state. This partial synthesis approach provides sufficient accuracy for practical quantum computing applications while dramatically reducing the computational resources required, achieving a good balance between precision and efficiency.
Data Source
AI summary
A computer-implemented method for generating a program to be executed using a quantum computer for producing as output a target quantum state based on an initial quantum state used as input is proposed, which comprises: determining an approximated quantum state which is an approximation of the target quantum state; determining a quantum circuit which, based on the initial quantum state received used as input, produces as output an output quantum state that corresponds to the approximated quantum state; and generating the program based on the determined circuit.