Quantum Device Initialization Using Segmented Polynomial Approximation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Preparing quantum states on a quantum computer requires substantial quantum resources, which undermines potential quantum advantage, and existing methods for approximating quantum states with single high-degree polynomials are inefficient and inaccurate.
Innovation Solution
A method involving splitting state variables into subsets and using lower-degree polynomial approximations for each subset, allowing for a compressed representation that requires fewer parameters and resources to prepare quantum devices efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a single high-degree polynomial is used to approximate the quantum state, then the quantum state can be represented, but the method is inefficient and inaccurate and requires substantial quantum resources
Solution Approach 1:
The patent divides the quantum state approximation into multiple segments by splitting the set of state variables into multiple subsets. Each subset is approximated by a separate lower-degree polynomial rather than using a single high-degree polynomial. This segmentation reduces the degree of each polynomial while maintaining overall accuracy, thereby reducing the quantum resources required for state preparation.
Solution Approach 2:
The patent combines multiple lower-degree polynomial approximations (one for each subset of state variables) to form a complete approximation of the quantum state. By merging these simpler polynomial representations, the system achieves accurate quantum state preparation without requiring substantial quantum resources, resolving the contradiction between accuracy and resource requirements.
2Manufacturing precision
If more quantum resources are used to prepare quantum states, then the accuracy of state preparation improves, but the potential quantum advantage is undermined
Solution Approach 1:
The patent changes the parameters of the polynomial approximation by reducing the degree of polynomials used and increasing the number of subsets. Instead of using fewer high-degree polynomials that require many quantum resources, the system uses more lower-degree polynomials that can be prepared with fewer quantum resources while maintaining precision. This parameter transformation resolves the contradiction between preparation precision and quantum advantage.
3Device complexity
If a compressed representation with fewer parameters is used, then resource efficiency improves, but handling discontinuities becomes more difficult
Solution Approach 1:
The patent segments the state variables into multiple subsets, allowing each subset to be approximated by a lower-degree polynomial. This segmentation enables the compressed representation to handle discontinuities effectively because each polynomial only needs to approximate a portion of the state variables, making it easier to capture local discontinuities without requiring a high-degree polynomial that would need many parameters.
Data Source
AI summary
A quantum computing system and associated method of preparing a plurality of quantum devices are disclosed. A compiling system of the quantum computing system is configured to receive a quantum state specification comprising a plurality of state variables defining a quantum state, determine a compressed representation of the quantum state, and send the compressed representation to a control system of the quantum computing system. The control system is configured to receive the compressed representation of the quantum state and use the compressed representation to prepare the plurality of quantum devices according to the quantum state.