18356634. EVALUATING QUANTUM COMPUTING CIRCUITS IN VIEW OF THE RESOURCE COSTS OF A QUANTUM ALGORITHM simplified abstract (Microsoft Technology Licensing, LLC)
Contents
- 1 EVALUATING QUANTUM COMPUTING CIRCUITS IN VIEW OF THE RESOURCE COSTS OF A QUANTUM ALGORITHM
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 EVALUATING QUANTUM COMPUTING CIRCUITS IN VIEW OF THE RESOURCE COSTS OF A QUANTUM ALGORITHM - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Unanswered Questions
- 1.11 Original Abstract Submitted
EVALUATING QUANTUM COMPUTING CIRCUITS IN VIEW OF THE RESOURCE COSTS OF A QUANTUM ALGORITHM
Organization Name
Microsoft Technology Licensing, LLC
Inventor(s)
Martin H. Roetteler of Woodinville WA (US)
Krysta M. Svore of Seattle WA (US)
EVALUATING QUANTUM COMPUTING CIRCUITS IN VIEW OF THE RESOURCE COSTS OF A QUANTUM ALGORITHM - A simplified explanation of the abstract
This abstract first appeared for US patent application 18356634 titled 'EVALUATING QUANTUM COMPUTING CIRCUITS IN VIEW OF THE RESOURCE COSTS OF A QUANTUM ALGORITHM
Simplified Explanation
The abstract describes methods for evaluating quantum computing circuits in terms of the resource costs of a quantum algorithm. It introduces a processor-implemented method for evaluating a polynomial corresponding to an input by determining polynomial interpolation for a set of sub-intervals and constructing a quantum circuit for parallel polynomial evaluation.
- Explanation of the patent:
- Processor-implemented method for evaluating polynomials using quantum circuits - Determines polynomial interpolation for sub-intervals of the input - Constructs quantum circuit for parallel polynomial evaluation
Potential Applications
Quantum computing, mathematical modeling, algorithm optimization
Problems Solved
Resource optimization in quantum computing, efficient polynomial evaluation
Benefits
Faster computation, reduced resource usage, improved algorithm efficiency
Potential Commercial Applications
Quantum computing software development, financial modeling, scientific research
Possible Prior Art
Prior methods for polynomial evaluation, quantum circuit design for specific algorithms
Unanswered Questions
1. How does this method compare to traditional polynomial evaluation techniques in terms of speed and accuracy? 2. Are there any limitations to the size or complexity of polynomials that can be evaluated using this method?
Original Abstract Submitted
Methods for evaluating quantum computing circuits in view of the resource costs of a quantum algorithm are described. A processor-implemented method for performing an evaluation of a polynomial corresponding to an input is provided. The method includes determining a polynomial interpolation for a set of sub-intervals corresponding to the input. The method further includes constructing a quantum circuit for performing, in parallel, polynomial evaluation corresponding to each of the set of sub-intervals.
