International Business Machines Corporation

Jpmorgan Chase Bank, N.a.

Globalfoundries Inc.

Globalfoundries U.S. 2 LLC

Marco Pistoia

Omer Tripp

Takaaki Tateishi

Salvatore Angelo Guarnieri

John J Ponzo

Joseph W Ligman

Pietro Ferrara

Gegi Thomas

Richard Chen

Shaohan Hu

Stephen Peter Wood

Paul Christesten Castro

Peng Liu

Jay Michael Gambetta

Yinnon Avraham Haviv

Omri Weisman

Lior Horesh

Roee Hay

Adi Sharabani

Ryan Berg

Julian Timothy Dolby

Raya Horesh

Antonio Mezzacapo

Paolina Centonze

Lawrence H Koved

David M Lubensky

Don Greenberg

Shay Artzi

Frank Tip

Guy M Cohen

Umut Topkara

Manu Sridharan

Stephen Darwin Teilhet

Anthony Joseph Nadalin

Stephen Fink

Rudy Raymond Harry Putra

Ali Javadiabhari

Nitendra Rajput

Blaine H Dolph

Justin David Weisz

Ory Segal

Giacomo Nannicini

Ori Segal

Ivano Tavernelli

Yunwu Huang

Birgit Monika Pfitzmann

Norbert George Vogl

Gregory Louis Truty

Jonathan Paul Munson

Guy Podjarny

Alaa Salah Youssef

Nikolai A Joukov

Giovanni Pacifici

Vasily Tarasov

Magda Mahmoud Mourad

John A Gunnels

Evgeny Beskrovny

Ismael Faro Sertage

Julia Elizabeth Rice

Michael George Burke

Yunhui Zheng

John Peyton

Panagiotis Barkoutsos

Bard Bloom

Chun-Fu Chen

Rocky J Maufort

John H Field

Zhong Su

Bo Yang

Anthony J Annunziata

Nataraj Nagaratnam

Shiwan Zhao

Quanfu Fan

Jim Alain Laredo

Bruce Arland Rich

Andrew Paul Wyskida

Honglei Guo

Benjamin L Fletcher

Sachiko Yoshihama

Toyotaro Suzumura

Eric James Barkie

Sean Moran

Nikolaj Moll

Andrew W Cross

Dmitri Maslov

Aleksandr Y Aravkin

Avraham Ever Shinnar

Dario Gil

Stefan Woerner

Mohammed Mostafa

Sergey Bravyi

Takashi Imamichi

Eran Yahav

Martin Vechev

Alessandro Morari

John Thomas Peyton, Jr

Francisco Jose Martin Fernandez

Ted A Habeck

Shinya Kawanaka

Constantin Gonciulea

A method for implementing all-to-all connectivity in gate-based quantum computers may include a classical computer program: receiving an optimization problem; constructing a problem Hamiltonian by assigning a qubit to each interactions between pairs of variables; associating each of the assigned qubits to a physical qubit in a physical qubit grid; assigning readout physical qubits in the physical qubit grid to neighbors of the associated physical qubits; instructing the quantum computer to apply a driving Hamiltonian and the problem Hamiltonian to the physical qubit grid; instructing the quantum computer to apply CNOT gates between associated physical qubits on edges of each triangle and square in the physical qubit grid and the readout physical qubits in centers of the triangles and squares; instructing the quantum computer to measure the readout physical qubits; and determining that the measurements of all readout physical indicates that parities between the physical qubits are enforced.

Systems and methods for implementing all-to-all connectivity in gate-based quantum computers using nearest-neighbor interactions

A method for optimized quantum searching may include: creating, by a classical computer program, a quantum circuit that implements Grover's algorithm; identifying, by the classical computer program in a pre-transpile step, instances of Hadamard gates (H gates) and Pauli X-gates (X gates) and instances of X gates and H gates in the quantum circuit; replacing, by the classical computer program, the instances of the H gates and X gates with Rx(π/2) gates and the instances of the X gates and H gates with Rx(−π/2) gates; implementing, by the classical computer program, a plurality of gates that implement a reflection about the mean in the quantum circuit; completing, by the classical computer program, transpiling the quantum circuit into a plurality of quantum instructions; sending, by the classical computer program, the quantum instructions to a quantum computer; and receiving, from the quantum computer, results of execution of the quantum instructions.

Systems and methods for optimized quantum searching

Systems and methods for secure cryptographic secret distribution are disclosed. In one embodiment, a method for secure cryptographic secret distribution may include: (1) receiving, at a key relay station, a cryptographic secret from a webserver over a first communication network; (2) storing, by the key relay station, the cryptographic secret; (3) authenticating, by the key relay station, an end user via an end user electronic device; and (4) securely communicating, by the key relay station, the cryptographic secret to the end user electronic device. The end user electronic device is configured to store the cryptographic secret in secure storage on the end user electronic device, to encrypt data with the cryptographic secret, and to communicate the encrypted data to the webserver over a second communication network.

Systems and methods for secure cryptographic secret distribution

System and methods for processing data queries in hybrid data mesh architectures are disclosed. A method for processing data queries in hybrid data mesh architectures may include an in-memory query engine: (1) receiving, from a requestor, a data query to retrieve data; (2) parsing the data query into a parse tree; (3) converting the parse tree into a relational tree, wherein the relational tree is a tree representation of relational operators used to execute the data query; and (4) executing a data retrieval method selected from the group consisting of tree partitioning by cost and pruning using subtree replacement using a plurality of retrieval services to retrieve data from data stores identified by the data retrieval method.

System and methods for processing data queries in hybrid data mesh architectures

A method may include: sharing, by a client computer program and a server computer program, a set of identification keys, each identification key associated with a key label, and an authentication key; selecting, by the client computer program and the server computer program, one of the key labels; preparing, by the client computer program, quantum systems using a basis, randomly chosen bit values, and intensities; sending, by the client computer program, the quantum systems to the server computer program over a quantum communication channel, wherein the server computer program may be configured to measure the quantum systems using the basis and to announce quantum systems with photon detection; and generating, by the client computer program, a client tag using a shared keyed hash function executed on the authentication key and chosen bit values from the quantum systems with photon detection, and forwarding the client tag to the server computer program.

Systems and methods for secure client-server authentication with key recycling

A quantum computer program may receive a mean, a standard deviation, and a discretization for a target normal distribution; determine a number of iterations t based on the mean and standard deviation; identify a value n from the discretization and value Xfrom the mean; initialize n qubits in register q and an ancilla; apply a quantum Fourier transform and a +Xgate to q; apply a Y-Rotation with angle π/2 to the ancilla; apply a controlled +1 gate to q controlled by the ancilla; apply a Hadamard gate to the ancilla; measure the ancilla; set a value C to a value of the measured ancilla; repeat from the Y-Rotation t times; apply an inverse quantum Fourier transform to q; and output amplitudes of basis states of q as the normal distribution. The program may use qubit-scaling to reduce the number of iterations needed.

Systems and methods for preparation of normal distributions on quantum computers

Systems and methods for wayfinding in hazardous environments are disclosed. In one embodiment, a method for wayfinding in a hazardous environment may include: (1) receiving, at an emergency response computer program executed by an electronic device, a plurality of real time streams of data, each real time stream of data from a sensing device in an area; (2) detecting, by the emergency response computer program, an alarm condition in the area based on the real-time streams of data; (3) determining, by the emergency response computer program, that the alarm condition satisfies an alarm condition rule; (4) calculating, by the emergency response computer program, a plurality of routes to an egress point from the area; and (5) controlling, by the emergency response computer program, a digital signage in the area to display one of the plurality of routes the egress point.

Systems and methods for wayfinding in hazardous environments

A system and a method for verifying a randomness of an intended random number is provided. The method includes: accessing the intended random number; converting the intended random number into a bitmap image; analyzing the bitmap image with reference to a predetermined model; and using a result of the analyzing to determine whether the intended random number is a true random number or a pseudorandom number. The analysis of the bitmap image may be performed by using a machine learning image classification technique with respect to a model that is trained by using white noise images.

Method and system for verification of random numbers

A method may include: a computer program populating a Hermitian matrix A with input data; calculating an upper bound a for a maximum eigenvalue for the Hermitian matrix A; initializing a time evolution value t=1/a; generating a first quantum computer program using the time evolution value t; communicating the first quantum computer program to a quantum computer; receiving a result including a binary value for each n-bit string and a probability for each binary value; converting each binary value into an integer; identifying a maximum absolute value of the integers; determining a value x for the maximum absolute value of all of the integers; updating the time evolution value t based on the value of x; generating a second quantum computer program using the updated time evolution value t; and communicating, by the classical computer program, the second quantum computer program to the quantum computer.

Systems and methods for optimization of time evolution for quantum computer-based eigenvalue estimation

Embodiments use quantum conditional logic in the Quantum Phase Estimation Algorithm (QPEA) to compute eigenvalues prior to inversion. Embodiments estimate the eigenvalues of a unitary, U=e, generated by a N×N Hermitian matrix Â. The binary representations of the n-bit estimations of eigenvalues of Â may be encoded in these states: |λ=|bb. . . b; λis an estimation of the i-th eigenvalue, excluding degeneracy, and .bb. . . bis its binary representation. To perform the eigenvalue inversion, an n-qubit controlled Ry rotation with angle λ/2conditioned on seeing |bb. . . bis applied for each possible n-bit binary string bb. . . b(2values). The overall unitary is called a 'uniformly controlled Ry rotation' in literature.

Systems and methods for enhanced eigenvalue inversion using quantum conditional logic

A method for dynamic detection and presentation of obscured real-world objects in augmented or mixed reality virtual content may include an object of interest computer program executed by an electronic device: (1) receiving data for a virtual or augmented reality object to display on an image of a physical environment on a display of the electronic device; (2) receiving data for a physical object in the physical environment; (3) determining that the physical object is obscured by the virtual or augmented reality object; (4) generating a representation of the physical object; and (5) providing the representation of the physical object to a virtual reality or augmented reality computer program executed by the electronic device, wherein the virtual reality or augmented reality computer program is configured to display the physical object over the virtual or augmented reality object.

Systems and methods for dynamic detection and presentation of obscured real-world objects in augmented or mixed reality virtual content

Systems, computer-implemented methods, and computer program products that can facilitate applying a reinforcement learning policy to available actions are described. 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 state encoder that maps, based on one or more encoding parameters, a state of an environment on to one or more qubits of a quantum device. The system can further comprise a variational component that combines a reinforcement learning policy with a sampling of the one or more qubits, resulting, based on one or more variational parameters, in a probability distribution of a plurality of available actions at the state of the environment.

Quantum reinforcement learning agent

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

A method for removing uninterested attributes from multi-modality data may include: receiving, by a multi-modality attribute removal computer program executed by an electronic device, multi-modality data comprising a plurality of modalities from a data source, wherein data in each modality are related; receiving, by the multi-modality attribute removal computer program, an uninterested attribute in the multi-modality data to remove; training, by the multi-modality attribute removal computer program, a modality-focused encoder for each modality of the multi-modality data to remove the uninterested attribute using a removal loss and a retention loss for the respective modality; receiving, by the multi-modality attribute removal computer program, a multi-modality data set for processing; and processing, by the multi-modality attribute removal computer program, the multi-modality data set using the modality-focused encoders, wherein the processing results in a processed multi-modality data set with the uninterested attribute removed and one or more interested attribute retained.

Systems and methods for removal of attributes from multi-modality and multi-attribute data

Systems and methods for efficient error mitigation in quantum circuit execution using parity checks and classical feedback are disclosed. A method may include a quantum computer: executing a quantum optimization algorithm comprising measurement points for measuring a quantum state parity, and termination instructions for stopping execution of the quantum optimization algorithm; preparing the quantum state; executing a first step of the quantum optimization algorithm; measuring a first parity of the quantum state; returning the first parity to a classical computer program; executing a second step of the quantum optimization algorithm; measuring a second parity of the quantum state; returning the second parity to the classical computer program that is configured to compare the first parity and the second parity; receiving an instruction to execute the termination instructions from the classical computer program in response to first parity and the second parity being different; and executing the termination instructions.

Systems and methods for efficient error mitigation in quantum circuit execution using parity checks and classical feedback

Growing community of inventors

Amawalk, NY, United States of America

Marco Pistoia