Rigetti & Co, LLC

Eric Christopher Peterson

Chad Tyler Rigetti

Matthew J Reagor

Robert Stanley Smith

Marcus Palmer Da Silva

Michael Justin Gerchick Scheer

Colm Andrew Ryan

Deanna Margo Abrams

Nikolas Anton Tezak

Christopher Butler Osborn

Peter Jonathan Karalekas

Erik Joseph Davis

Anand Desai

Steven Heidel

Muhammad Sohaib Alam

Glenn Jones

Adam David Lynch

Michael Rust

David Bryant

In a general aspect, a quantum program can be automatically synthesized or compiled. In some implementations, a discretized state space is obtained. The discretized state space includes a plurality of states for one or more qubits of a quantum processor. A discrete action space is obtained. The discrete action space includes a plurality of unitary operations for the one or more qubits of the quantum processor. A policy that uses the discretized state space and the discrete action space to generate quantum programs for quantum state preparation is defined. A dynamic programming process is used to improve the policy. An initial state and a target state of the one or more qubits is identified. The policy is used to generate a quantum program to produce the target state from the initial state. The quantum program include a subset of the unitary operations in the discrete action space.

Automated synthesizing and compilation of quantum programs

A compiler for a gate-based superconducting quantum computer compiles hybrid classical/quantum algorithms for quantum processing cells with different configurations. The compiler inputs the algorithm and outputs code in a target language executable by a quantum processing cell of a quantum processing system that can execute the algorithm. The compiler includes various functionality, such as: parsing, analyzing control flows, addressing, compressing, and translating. The compiler optimizes algorithms in various manners using the functionality. Some optimizations include addressing efficiently, compressing based on simulations, and translating for efficient execution of parametric functions. The compiler may function in the environment of a cloud quantum computing system. The cloud quantum computing system may receive algorithms from remote access nodes for execution on local classical and quantum computing systems.

Quantum instruction compiler for optimizing hybrid algorithms

In a general aspect, a gate is formed for a quantum processor. In some implementations, an arbitrary program is received. The arbitrary program includes a first sequence of quantum logic gates, which includes a parametric XY gate. A native gate set is identified, which includes a set of quantum logic gates associated with a quantum processing unit. A second sequence of quantum logic gates corresponding to the parametric XY gate is identified, which includes a parametric quantum logic gate. Each of the quantum logic gates in the second sequence is selected from the native gate set. A native program is generated. The native program includes a third sequence of quantum logic gates. The third sequence of quantum logic gates corresponds to the first sequence of quantum logic gates and includes the second sequence of quantum logic gates. The native program is provided for execution by the quantum processing unit.

Gate formation on a quantum processor

In a general aspect, a computer system includes a low-latency communication link between a classical computer and a quantum computing resource. In some cases, a quantum machine image operates on a classical computer system. The quantum machine image includes a virtualized execution environment for quantum programs. The quantum machine image is engaged with a quantum processing unit of a quantum computing system. A quantum program is communicated over a low-latency communication pathway from the classical computer system to the quantum computer system. The quantum program is executed at the quantum computer system.

Low-latency, high-performance hybrid computing

Gate formation for a quantum processor

A compiler translates programs for execution on a quantum processing system. To facilitate portability of quantum programs across differently configured quantum processors, the compiler accepts a specification of the quantum processor as input along with a quantum program for compilation. A specification may include information about the type of each qubit device in the quantum processor, the number of qubits, the qubit topology, coherence times of individual qubits, and operations that the quantum processor supports. The compilation process may include manipulating operations of the input program to generate equivalent operations that can be performed by the quantum gates and qubit devices on the quantum processor for which the program is being compiled.

Retargetable compilation for quantum computing systems

Growing community of inventors

Berkeley, CA, United States of America

Eric Christopher Peterson