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

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

Abstract: Techniques for encoding quantum circuit mapping problems as SAT solver optimization problems are disclosed. Quantum circuit mapping often requires the use of swap gates to configure logical quantum computations for execution using fixed quantum hardware 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 and encodes the information into a CNF equation using a layout-transition-based encoding scheme. The CNF equation is then provided to a SAT solver to determine an assignment for the mapping using the requested number of swap gates. Multiple CNF equations corresponding to different requested numbers of swap gates may be solved for in parallel using multiple SAT solving instances.

Key Features and Innovation:

• Encoding quantum circuit mapping problems as SAT solver optimization problems.
• Use of swap gates to configure logical quantum computations for fixed quantum hardware layouts.
• Quantum compilation service to solve mapping using CNF equations.
• Layout-transition-based encoding scheme for CNF equations.
• Parallel solving of multiple CNF equations for different numbers of swap gates.

Potential Applications: - Quantum computing optimization. - Quantum circuit mapping automation. - Quantum compilation services for hardware layouts.

Problems Solved: - Efficient mapping of logical quantum circuits to physical qubit layouts. - Automation of swap gate usage for quantum computations. - Optimization of quantum circuit execution on fixed hardware layouts.

Benefits: - Improved efficiency in quantum circuit mapping. - Reduction in manual effort for configuring quantum computations. - Enhanced performance of quantum algorithms on fixed hardware.

Commercial Applications: Title: Quantum Circuit Mapping Optimization for Quantum Computing Industry Description: This technology can be utilized by quantum computing companies to automate the mapping of logical quantum circuits to physical qubit layouts, improving overall efficiency and performance in quantum computations.

Prior Art: Further research can be conducted in academic journals and patent databases related to quantum circuit mapping, SAT solver optimization, and quantum compilation services.

Frequently Updated Research: Stay updated on advancements in quantum circuit mapping techniques, SAT solver optimization algorithms, and quantum compilation services through academic publications and industry conferences.

Questions about Quantum Circuit Mapping Optimization: 1. How does this technology improve the efficiency of quantum circuit mapping? 2. What are the key challenges in automating the mapping of logical quantum circuits to physical qubit layouts?

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.