International Business Machines Corporation

Glocbalfoundries Inc.

Jay Michael Gambetta

Jerry M Chow

Lev Samuel Bishop

Marco Pistoia

Matthias Steffen

Ismael Faro Sertage

Patryk Gumann

David C Mckay

Ali Javadiabhari

Salvatore Bernardo Olivadese

Andrew W Cross

Paul Kristan Temme

David William Abraham

Hanhee Paik

Antonio Mezzacapo

Francisco Jose Martin Fernandez

Antonio Corcoles-Gonzalez

Easwar Magesan

Richard Chen

Stephen Peter Wood

Mary Beth Rothwell

Shaohan Hu

James Robert Rozen

Sergey Bravyi

Maika Takita

Chad Tyler Rigetti

Firat Solgun

Rudy Raymond Harry Putra

Dmitri Maslov

Oliver Dial

Abhinav Kandala

Douglas T McClure, Iii

John Aaron Smolin

Sarah Elizabeth Sheldon

Sami Rosenblatt

Jason Scott Orcutt

Markus Brink

Martin O Sandberg

Don Greenberg

Antonio D Corcoles Gonzalez

Stefan Filipp

Paul Nation

Baleegh Abdo

Jared Barney Hertzberg

Sean Hart

Peng Liu

Ivano Tavernelli

Nicholas A Masluk

Ramis Movassagh

Josephine B Chang

David Louis Kaminsky

Mark N Wegman

John A Gunnels

Mark B Ketchen

Nicholas Torleiv Bronn

Andrew P Wack

Theodore James Yoder

Guanyu Zhu

Zlatko Kristev Minev

Christopher Chamberland

Xuan Wei

Seth T Merkel

Nikolaj Moll

Stefan Woerner

Julia Elizabeth Rice

Panagiotis Barkoutsos

Christophe Piveteau

Pauline Ollitrault

Srikanth Srinivasan

Jennifer Ranae Glick

Renier Rodriguez Morales

Tanvi Pradeep Gujarati

Thomas George McConkey

Luciano Bello

Christopher W Surovic

Blake Johnson

David Sutter

Raymond A Watters

Sanjana Arun Sharma

Anna Obikane

Francisco José Cabrera Hernández

Ismael Faro Serfage

Vojtech Havlicek

Robert Meinel

Systems, computer-implemented methods, and computer program products to facilitate evaluation of quantum circuit optimization routines and knowledge base generation are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components can comprise a compilation component that concurrently executes different quantum circuit optimization sequences on multiple copies of a quantum circuit. The computer executable components can further comprise an identification component that identifies at least one of the different quantum circuit optimization sequences that generates an output quantum circuit comprising defined criteria.

Quantum circuit optimization routine evaluation and knowledge base generation

Systems and techniques that facilitate Stark shift cancellation are provided. In various embodiments, a system can comprise a control qubit that is coupled to a target qubit. In various cases, the control qubit can be driven by a first tone that entangles the control qubit with the target qubit. In various aspects, the control qubit can be further driven by a second tone simultaneously with the first tone. In various cases, the second tone can have an opposite detuning sign than the first tone. In various instances, the first tone can cause a Stark shift in an operational frequency of the control qubit, and the second tone can cancel the Stark shift.

Stark shift cancellation

A compatibility is ascertained between a configuration of a quantum processor (q-processor) of a quantum cloud compute node (QCCN) in a quantum cloud environment (QCE) and an operation requested in a first instruction in a portion (q-portion) of a job submitted to the QCE, the QCE including the QCCN and a conventional compute node (CCN), the CCN including a conventional processor configured for binary computations. In response to the ascertaining, a quantum instruction (q-instruction) is constructed corresponding to the first instruction. The q-instruction is executed using the q-processor of the QCCN to produce a quantum output signal (q-signal). The q-signal is transformed into a corresponding quantum computing result (q-result). A final result is returned to a submitting system that submitted the job, wherein the final result comprises the q-result.

Job processing in quantum computing enabled cloud environments

Techniques for managing and compressing quantum output data (QOD) associated with quantum computing are presented. In response to receiving QOD from a quantum computer, a compressor component can compress QOD at first compression level to generate first compressed QOD, and can compress QOD at second compression level to generate second compressed QOD, the second compressed QOD can be less compressed than the first compressed QOD. Compressor management component (CMC) can determine whether first QOD includes sufficient data to enable it to be suitably processed by quantum logic. If so, CMC can allow first compressed QOD to continue to be sent to quantum logic and can discard second compressed QOD. If not sufficient, CMC can determine that second compressed QOD is to be processed by quantum logic. If CMC determines second compressed QOD does not include sufficient data, CMC can determine that the QOD is to be processed by quantum logic.

Dynamic quantum data output post-processing

According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise an extrapolation component that extrapolates a system parameter of a parameter set to determine a starting parameter value of a variational circuit. The computer executable components can further comprise a variational component that determines a system parameter value of the parameter set based on the starting parameter value.

Parameter extrapolation in quantum variational circuits

Lattice arrangements for quantum qubits are described. A lattice arrangement can comprise adjacent structures having vertices connected by edges. The qubits can be positioned on the vertices. A qubit in the lattice arrangement directly connects to not more than three other qubits, or connects to another qubit via a coupling qubit on an edge between two qubits on a vertex. The adjacent structures can comprise hexagons, dodecagons or octagons. A superconducting qubit lattice can comprise superconducting target qubits and superconducting control qubits. The superconducting qubit lattice can comprise adjacent structures having vertices connected by edges, with target qubits positioned on the vertices and control qubits positioned on the edges. Logic operations between adjacent superconducting target and control qubits can be implemented by driving the superconducting control qubit at or near the frequency of the superconducting target qubit.

Reducing qubit frequency collisions through lattice design

A method for validation and runtime estimation of a quantum algorithm includes receiving a quantum algorithm and simulating the quantum algorithm, the quantum algorithm forming a set of quantum gates. The method further includes analyzing a first set of parameters of the set of quantum gates and analyzing a second set of parameters of a set of qubits performing the set of quantum gates. The method further includes transforming, in response to determining at least one of the first set of parameters or the second set of parameters meets an acceptability criterion, the quantum algorithm into a second set of quantum gates.

Validating and estimating runtime for quantum algorithms

A quantum computer includes a quantum processor that includes a first plurality of qubits arranged in a hexagonal lattice pattern such that each is substantially located at a hexagon apex, and a second plurality of qubits each arranged substantially along a hexagon edge. Each of the first plurality of qubits is coupled to three nearest-neighbor qubits of the second plurality of qubits, and each of the second plurality of qubits is coupled to two nearest-neighbor qubits of the first plurality of qubits. Each of the second plurality of qubits is a control qubit at a control frequency. Each of the first plurality of qubits is a target qubit at one of a first target frequency or a second target frequency. The quantum computer includes an error correction device configured to operate on the hexagonal lattice pattern of the plurality of qubits so as to detect and correct data errors.

Quantum code for reduced frequency collisions in qubit lattices

Systems, computer-implemented methods, and computer program products to facilitate translation of a quantum design across multiple applications are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a quantum library component that stores a data structure representing a quantum geometry that is a physical representation of a quantum element in a quantum component. The computer executable components can further comprise a quantum renderer component that translates the quantum geometry into a defined format of an application based on the data structure.

Translation of a quantum design across multiple applications

Techniques and a system for quantum computing device modeling and design are provided. In one example, a system includes a modeling component and a simulation component. The modeling component models a quantum device element of a quantum computing device as an electromagnetic circuit element to generate electromagnetic circuit data for the quantum computing device. The simulation component simulates the quantum computing device using the electromagnetic circuit data to generate response function data indicative of a response function for the quantum computing device. Additionally or alternatively, a Hamiltonian is constructed based on the response function.

Quantum computing device design

A repository is configured in a hybrid data processing environment comprising a classical computing system and a quantum computing system, to hold a plurality of quantum circuit components (QCC(s)). A degree of difficulty in simulating the received QCC in the classical computing system is transformed into a classical hardness score. A degree of difficulty in implementing the received QCC in the quantum computing system is transformed into a quantum hardness score. A first parameter in a metadata data structure associated with the received QCC is populated with the classical hardness score. A second parameter in the metadata data structure associated with the received QCC is populated with the quantum hardness score. The received QCC is transformed into a library element by at least augmenting the received QCC with the metadata data structure. The library element is added to the repository.

Providing reusable quantum circuit components as a curated service

A method of mitigating quantum readout errors by stochastic matrix inversion includes performing a plurality of quantum measurements on a plurality of qubits having predetermined plurality of states to obtain a plurality of measurement outputs; selecting a model for a matrix linking the predetermined plurality of states to the plurality of measurement outputs, the model having a plurality of model parameters, wherein a number of the plurality of model parameters grows less than exponentially with a number of the plurality of qubits; training the model parameters to minimize a loss function that compares predictions of the model with the matrix; computing an inverse of the model based on the trained model parameters; and providing the computed inverse of the model to a noise prone quantum readout of the plurality of qubits to obtain a substantially noise free quantum readout.

Quantum readout error mitigation by stochastic matrix inversion

A method includes measuring an amplitude of a state of a quantum circuit, the amplitude corresponding to a first location in an object database. In the embodiment, the method includes executing, using a classical processor and a first memory, a verification operation, responsive to measuring the amplitude, to verify a target object in the first location. In the embodiment, the method includes re-measuring a second amplitude of a second state of the quantum circuit, the second amplitude having undergone a first plurality of amplitude amplifications, the second amplitude corresponding to a second location in the object database, the second location being verified as the target object, and wherein a total number of the first plurality of amplitude amplifications being less than a square root of a set of objects in the object database.

Automatic quantum searching of object databases

Systems and techniques that facilitate backend quantum runtimes are provided. In various embodiments, a system can comprise a backend receiver component that can access a computer program provided by a client device, wherein the computer program is configured to indicate a quantum computation. In various aspects, the system can further comprise a backend runtime manager component that can host the computer program by instantiating a backend classical computing resource. In various instances, the backend classical computing resource can orchestrate both classical execution of the computer program and quantum execution of the quantum computation indicated by the computer program.

Backend quantum runtimes

In an embodiment, a method includes measuring a first number of control qubits in a quantum algorithm, wherein a quantum circuit representation of the quantum algorithm includes a multiple-controlled-NOT gate. In an embodiment, a method includes measuring a second number of ancilla qubits in a quantum computer. In an embodiment, a method includes comparing the first number and the second number to determine an optimum compilation method for a quantum circuit. In an embodiment, a method includes compiling, in response to the comparison determining the second number is greater than one and less than the difference of the first number and 2, a quantum circuit from the quantum algorithm using a hybrid method.

Adaptive quantum circuit construction for multiple-controlled-not gates

Growing community of inventors

Yorktown Heights, NY, United States of America

Jay Michael Gambetta