International Business Machines Corporation

Jpmorgan Chase Bank, N.a.

Shaohan Hu

Marco Pistoia

Stephen Peter Wood

Peng Liu

Jay Michael Gambetta

Richard Chen

Rudy Raymond Harry Putra

Antonio Mezzacapo

Bill Moriarty

Youngwook Do

John A Gunnels

Dmitri Maslov

Rocky J Maufort

Alexander Buts

Matthew Murphy

Dylan Herman

Pierre Minssen

Arthur Giuseppe Rattew

Hargun Kalsi

Romina Yalovetzky

Joseph W Ligman

Sean Moran

Nikolaj Moll

Sergey Bravyi

Julia Elizabeth Rice

Ivano Tavernelli

Panagiotis Barkoutsos

Brett Sanford

William R Moriarty

Aniella Arantes

Zhonghao Shi

Ruslan Shaydulin

Method and systems for obtaining direct feedback from a payment card by using energy received from a radio frequency identification (RFID) card reader is provided. The method is implemented by a processor that is embedded in the payment card. The method includes: receiving, from the RFID card reader, a radio frequency (RF) signal that relates to a proposed transaction; transmitting, to the RFID card reader, account information that relates to the proposed transaction; and causing an actuator that is embedded in the payment card to actuate a feedback action based on the RF signal. The actuator may include a haptic device that generates a vibration that is detectable by a touch of a user of the payment card.

Method and system for obtaining direct feedback from interactive passive RFID card

Payment cards with activated information displays are described. In one embodiment, a payment card may include: a first layer; a second layer comprising an elastic material; an actuator; and an information layer between the first layer and the second layer, comprising: a plurality of information voids; and a microfluidic channel that communicates the plurality of information voids with the actuator. A fluid may be provided in the microfluidic channel such that when the actuator is depressed, fluid flows into the information voids making the information voids visible through the second layer, and when the actuator is released, the fluid flows out of the information voids making the information voids substantially invisible through the second layer.

Payment cards with activated information displays

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 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 contactless card may include: a first card portion and a second card portion; a manipulation area between the first card portion and the second card portion, wherein the contactless card may be manipulatable about the manipulation area; a chip storing information; and an antenna in communication with the chip comprising a first antenna portion in the first card portion and a second antenna portion in the second card portion, wherein the first antenna portion and the second antenna portion are electrically connected when the contactless card is in a first orientation such that the information can be read by radio frequency communication from the chip via the antenna, and the first antenna portion and the second antenna portion are electrically disconnected when the contactless card is in a second orientation such that the information cannot be read by radio frequency communication from the chip via the antenna.

Contactless card with dynamic protection against covert radio frequency reading

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

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 techniques that facilitate partitioned template matching and/or symbolic peephole optimization are provided. In various embodiments, a system can comprise a template component, which can perform template matching on a Clifford circuit associated with a set of qubits. In various aspects, the system can comprise a partition component, which can partition, prior to the template matching, the Clifford circuit into a computation stage, a Pauli stage, and a SWAP stage. In various instances, the template matching can be performed on the computation stage. In various embodiments, the system can comprise a symbolic component, which can select a subset of qubits from the set of qubits, rewrite at least one entangling gate in the computation stage such that a target of the at least one entangling gate is in the subset of qubits, and replace the at least one rewired entangling gate with a symbolic Pauli gate. In various cases, the symbolic Pauli gate can be a Pauli gate that is controlled by a symbolic variable. In various aspects, the system can comprise a peephole component, which can perform peephole optimization on the subset of qubits with the symbolic Pauli gate by implementing a dynamic programming algorithm.

Partitioned template matching and symbolic peephole optimization

A global partitioning-based method for anonymizing a dataset of biometric data may include an anonymization computer program: (1) receiving a value k representing a number of records to hide a biometric datum among, a value t that represents a t-closeness parameter for a t-close distribution, a weight parameter, and a first number of features to retain for determining an attribute of interest; (2) receiving the attribute of interest; (3) calculating a distribution of the attribute of interest in a biometric dataset; (4) splitting the biometric dataset into a plurality of k-sized clusters that satisfy the t-close distribution; (5) anonymizing each biometric datum in the plurality of k-sized clusters using a weighted average of landmarks for the biometric datums in k-sized clusters using the weight parameter; (6) adding each anonymized biometric datum into an anonymized biometric dataset; and (7) persisting the anonymized biometric dataset.

Systems and methods for anonymizing a dataset of biometric data while retaining data utility

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

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

From a quantum program a first mutant is generated using a processor and a memory, where the first mutant is a randomly-generated transformation of the quantum program. A quality score, a correctness distance, and a probability of acceptance corresponding to the first mutant are computed. An acceptance corresponding to the first mutant is determined according to the probability of acceptance. Upon determining that an acceptance of the first mutant corresponding to the probability of acceptance exceeds an acceptance threshold, the quantum program is replaced with the first mutant. Upon determining that the quality score exceeds a storage threshold and that the correctness distance is zero, the first mutant is stored. These actions are iterated until reaching an iteration limit.

Growing community of inventors

Yorktown Heights, NY, United States of America

Shaohan Hu