Amazon technologies, inc. (20240330735). CLOUD-BASED QUANTUM COMPILATION SERVICE FOR QUANTUM CIRCUIT MAPPING USING SAT SOLVING TECHNIQUES simplified abstract

From WikiPatents
Revision as of 15:28, 4 October 2024 by Wikipatents (talk | contribs) (Creating a new page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

CLOUD-BASED QUANTUM COMPILATION SERVICE FOR QUANTUM CIRCUIT MAPPING USING SAT SOLVING TECHNIQUES

Organization Name

amazon technologies, inc.

Inventor(s)

Yunong Shi of Old Greenwich CT (US)

Marijn J. Heule of Pittsburgh PA (US)

Michael William Whalen of Edina MN (US)

Bruno Dutertre of Mountain View CA (US)

Eric M Kessler of New Rochelle NY (US)

Benjamin Kiesl-reiter of Munich (DE)

Robert Jones of Beaverton OR (US)

David Nunnerley of Bainbridge Island WA (US)

CLOUD-BASED QUANTUM COMPILATION SERVICE FOR QUANTUM CIRCUIT MAPPING USING SAT SOLVING TECHNIQUES - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240330735 titled 'CLOUD-BASED QUANTUM COMPILATION SERVICE FOR QUANTUM CIRCUIT MAPPING USING SAT SOLVING TECHNIQUES

    • Simplified Explanation:**

The patent application discusses techniques for encoding quantum circuit mapping problems as SAT solver optimization problems. This involves using swap gates to configure logical quantum computations on fixed quantum hardware layouts.

    • Key Features and Innovation:**

- Quantum compilation service encodes quantum circuit mapping information into CNF equations. - Layout-transition-based encoding scheme is used for mapping. - SAT solver attempts to determine an assignment for the mapping using a set number of swap gates. - Multiple CNF equations can be solved in parallel for different requested numbers of swap gates.

    • Potential Applications:**

- Quantum computing - Quantum circuit optimization - Quantum compilation services

    • Problems Solved:**

- Efficient mapping of logical quantum circuits to physical qubit connectivity graphs - Optimizing quantum computations using swap gates - Solving quantum circuit mapping problems using SAT solvers

    • Benefits:**

- Improved efficiency in quantum circuit mapping - Enhanced optimization of quantum computations - Streamlined quantum compilation services

    • Commercial Applications:**

- Quantum computing software development - Quantum hardware optimization services - Research and development in quantum algorithms

    • Prior Art:**

Prior research in quantum circuit mapping and optimization techniques using SAT solvers and swap gates.

    • Frequently Updated Research:**

Ongoing advancements in quantum compilation services and quantum circuit mapping algorithms.

    • Questions about Quantum Circuit Mapping:**

1. How does the use of swap gates impact the efficiency of quantum circuit mapping? 2. What are the key challenges in encoding quantum circuit mapping problems as SAT solver optimization problems?


Original Abstract Submitted

techniques for encoding quantum circuit mapping problems as sat solver optimization problems are disclosed. quantum circuit mapping often requires the use of swap gates in order to configure logical quantum computations to be executed using fixed quantum hardware device layouts. a quantum compilation service takes a logical quantum circuit, a physical qubit connectivity graph, and a requested number of swap gates to solve the mapping using and encodes the information into a conjunctive normal form (cnf) equation using a layout-transition-based encoding scheme. the cnf equation is then provided to a sat solver which attempts to determine an assignment for the mapping using the set number of swap gates requested. multiple cnf equations corresponding to different requested numbers of swap gates may be solved for in parallel using multiple sat solving instances.