Quantum Annealer Simulator Using Classical Algorithms

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Building and simulating quantum annealers are expensive and difficult, and simulating quantum systems is computationally hard, which negates any potential speedup from quantum tunneling effects.

Innovation Solution

A cost-effective quantum annealer simulator is developed for classical computers, approximating unitary quantum dynamics using algorithms like mean-field approximations, semi-classical approaches, and thermal cooling, allowing for efficient computation of optimization problems.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If quantum hardware is built for quantum annealing, then quantum tunneling speedup is achieved, but cost and manufacturing difficulty increase significantly

Engineering Contradiction:

Improveoptimization speedVSAvoidquantum hardware construction

Core Design Contradiction:

ProductivityVSEase of manufacture

Solution Approach 1:

The patent creates a simulated copy of quantum annealing behavior using classical computing techniques. Instead of building actual quantum hardware, the invention replicates quantum tunneling effects through classical algorithms that mimic quantum dynamics, thereby achieving similar optimization performance without the manufacturing challenges of quantum hardware

Inventive Principle:

Principle #26Copying

Solution Approach 2:

The patent replaces the physical quantum mechanical system with a classical computational model. By substituting actual quantum tunneling with classical algorithms that simulate quantum behavior, the invention eliminates the need for complex quantum hardware while maintaining the essential speedup benefits

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

2Reliability

If full quantum system simulation is performed on classical computers, then quantum effects are accurately captured, but computational complexity becomes exponential

Engineering Contradiction:

Improvequantum effect accuracyVSAvoidcomputational complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies partial quantum simulation by focusing only on the essential quantum effects needed for optimization (tunneling through energy barriers) while ignoring less critical quantum phenomena. This selective approach captures sufficient quantum behavior to maintain accuracy while avoiding the exponential complexity of full quantum system simulation

Inventive Principle:

Principle #16Partial or excessive action

Solution Approach 2:

The patent transforms the quantum simulation problem by changing parameters from exact quantum mechanical descriptions to approximate classical representations. By adjusting the level of quantum effect modeling to match computational constraints, the invention maintains reliability for optimization purposes while reducing complexity to polynomial time

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS9152746B2Quantum annealing simulator

Publication Date: 2015.10.06 MICROSOFT TECHNOLOGY LICENSING LLC

AI summary

A quantum annealer simulator approximates unitary quantum dynamics of a quantum annealer on a non-quantum computing device such as a conventional computing device. The quantum annealer simulator may utilize algorithms that may efficiently approximate unitary time evolution of a quantum system, where the quantum system corresponds to a problem for which an optimized solution is sought.