Patents by Inventor Marco Pistoia

Marco Pistoia has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20230120993
    Abstract: Systems and methods for automatic redaction of sensitive information from video streams are disclosed. According to one embodiment, a method for automatic redaction of sensitive information from video streams may include: (1) receiving, by an image processing computer program executed by an electronic device, a video stream of an area; (2) identifying, by the image processing computer program, an object capable of having sensitive information thereon in the video stream of the area; and (3) redacting or obscuring, by the image processing computer program, the object in the video stream.
    Type: Application
    Filed: October 18, 2021
    Publication date: April 20, 2023
    Inventors: Marco PISTOIA, Bill MORIARTY, Hargun KALSI, Matthew MURPHY, Shaohan HU
  • Publication number: 20230113125
    Abstract: 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.
    Type: Application
    Filed: October 8, 2021
    Publication date: April 13, 2023
    Inventors: Marco PISTOIA, Bill MORIARTY, Shaohan HU, Hargun KALSI, Aniella ARANTES
  • Patent number: 11620534
    Abstract: Configuring a quantum computing system to determine a solution to an optimization problem includes encoding the optimization problem in an encoding language to produce an encoded optimization model. The encoded optimization model is transformed into a unconstrained model. The encoded optimization model includes an objective function having one or more terms. The one or more terms are converted to one or more Pauli terms. An Ising Hamiltonian is generated using the one or more terms. The Ising Hamiltonian corresponds to the optimization problem. An instruction indicative of the Ising Hamiltonian is provided to the quantum computing system.
    Type: Grant
    Filed: March 18, 2019
    Date of Patent: April 4, 2023
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Atsushi Matsuo, Takashi Imamichi, Marco Pistoia
  • Patent number: 11609751
    Abstract: 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.
    Type: Grant
    Filed: December 19, 2018
    Date of Patent: March 21, 2023
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Shaohan Hu, Rudy Raymond Harry Putra, Stephen Wood, Marco Pistoia, Jay M. Gambetta
  • Patent number: 11599823
    Abstract: 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.
    Type: Grant
    Filed: August 14, 2019
    Date of Patent: March 7, 2023
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Peng Liu, Shaohan Hu, Stephen Wood, Marco Pistoia, Arthur Giuseppe Rattew
  • Patent number: 11574458
    Abstract: In one or more embodiments described herein, device, computer-implemented methods, and/or computer program products that facilitate automated survey results generation from an image 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 an image capturing component that captures a first sample image. The computer executable components can further comprise an image processing component that processes the first sample image to determine a survey count, wherein the survey count indicates a number of times a survey image was identified in the first sample image. The computer executable components can further comprise an authentication component that adjusts the survey count based on detection of a discrepancy.
    Type: Grant
    Filed: January 2, 2019
    Date of Patent: February 7, 2023
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Lior Horesh, Dario Gil, Marco Pistoia, Anthony Annunziata, Richard Chen
  • Publication number: 20230017335
    Abstract: A method for solving a problem using a quantum oracle may include a classical computer program: selecting an implementation for a problem from one or more different implementations in a dictionary of implementations; preparing the implementation using bounds on a quantum circuit to solve the problem and encoding input data for the problem into a quantum state; selecting an oracle to monitor and measure the quantum state based on the implementation, wherein the oracle identifies a pattern of interest in the quantum state; transpiling the prepared implementation and the oracle into a set of machine-readable instructions; sending the set of machine-readable instructions to a quantum computer, wherein the quantum computer executes the set of machine-readable instructions and returns an array of results, the array of results representing measurements of the quantum state using the oracle; and analyzing the array of results and outputting the analysis.
    Type: Application
    Filed: May 6, 2022
    Publication date: January 19, 2023
    Inventors: Constantin GONCIULEA, Austin GILLIAM, Marco PISTOIA
  • Patent number: 11556830
    Abstract: Systems and methods that address an optimized method in the area of optimization by showing how to generate Ising Hamiltonians automatically for a large class of optimization problems specially handling the constraints. The innovation facilitates qubit reduction in connection with an optimization problem by representing respective integer variables as linear sums of binary variables, wherein depending on the representation, additional equality constraints are provided. Additional slack variables are introduced to change inequality constraints to equality constraints. Based on the equality constraints, an unconstrained pseudo-boolean optimization problem is created. The pseudo-boolean optimization problem is quadratized to generate a quadratic pseudo-boolean function (QPBF) and the number of variables in the QPBF is reduced to facilitate qubit reduction. This results in an automated, problem instance dependent qubit reduction procedure.
    Type: Grant
    Filed: November 19, 2019
    Date of Patent: January 17, 2023
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Marco Pistoia, Rahul Sarkar
  • Patent number: 11544611
    Abstract: Techniques regarding quantum computation of molecular excited states are provided. For example, one or more embodiments described herein can comprise a system, which can comprise a memory that can store computer executable components. The system can also comprise a processor, operably coupled to the memory, and that can execute the computer executable components stored in the memory. The computer executable components can comprise an initialization component that can categorize a plurality of excited operators from a mapped qubit Hamiltonian into sectors based on a commutation property of the plurality of excited operators with a symmetry from the mapped qubit Hamiltonian. The computer executable components can also comprise a matrix component that can generate an equation of motion matrix from an excited operator from the plurality of excited operators based on the sectors categorized by the initialization component.
    Type: Grant
    Filed: December 12, 2018
    Date of Patent: January 3, 2023
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Richard Chen, Antonio Mezzacapo, Marco Pistoia, Pauline Ollitrault, Ivano Tavernelli, Jay M. Gambetta
  • Publication number: 20220414511
    Abstract: A hybrid classical-quantum computing device to execute a quantum circuit corresponding to a variational problem, is configured. The configuring further comprises causing the hybrid classical-quantum computing device to execute the quantum circuit by performing an adiabatic progression operation, wherein the adiabatic progression operation comprises increasing the difficulty of the variational problem from a simplified version of the problem to the variational problem.
    Type: Application
    Filed: April 26, 2022
    Publication date: December 29, 2022
    Applicant: International Business Machines Corporation
    Inventors: Don Greenberg, Marco Pistoia, Richard Chen, Giacomo Nannicini
  • Publication number: 20220414510
    Abstract: A hybrid classical-quantum computing device to execute a quantum circuit corresponding to a variational problem, is configured. The configuring further comprises causing the hybrid classical-quantum computing device to execute the quantum circuit by performing an adiabatic progression operation, wherein the adiabatic progression operation comprises increasing the difficulty of the variational problem from a simplified version of the problem to the variational problem.
    Type: Application
    Filed: April 26, 2022
    Publication date: December 29, 2022
    Applicant: International Business Machines Corporation
    Inventors: Don Greenberg, Marco Pistoia, Richard Chen, Giacomo Nannicini
  • Publication number: 20220391468
    Abstract: 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 X0 from the mean; initialize n qubits in register q and an ancilla; apply a quantum Fourier transform and a +X0 gate 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.
    Type: Application
    Filed: June 3, 2021
    Publication date: December 8, 2022
    Inventors: Yue SUN, Marco PISTOIA, Pierre MINSSEN, Arthur G. RATTEW
  • Patent number: 11522949
    Abstract: Systems and methods for cloud-based hybrid service meshes in microservice architectures are disclosed. A method for selection of a microservice in a cloud-based hybrid mesh microservice architecture may include: (1) receiving, at a hybrid service mesh library in a first microservice instance, a request for a second microservice, wherein the hybrid service mesh library comprises microservice information for a plurality of microservice instances comprising an identification of each microservice instance, a location for each microservice instance, and a status for each microservice instance; (2) identifying, by the hybrid service mesh library, a number of microservice instances for the microservice and the location of each microservice instance; (3) selecting, by the hybrid service mesh library, one of the plurality of microservice instances; and (4) calling, by the hybrid service mesh library, the selected microservice instance.
    Type: Grant
    Filed: November 19, 2021
    Date of Patent: December 6, 2022
    Assignee: JPMORGAN CHASE BANK, N.A.
    Inventors: Narayana Tummala, Marco Pistoia, Andrew Feig
  • Publication number: 20220382827
    Abstract: 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=eiÂt, generated by a N×N Hermitian matrix Â. The binary representations of the n-bit estimations of eigenvalues of  may be encoded in these states: |?i=|b1b2 . . . bn; ?i is an estimation of the i-th eigenvalue, excluding degeneracy, and .b1b2 . . . bn is its binary representation. To perform the eigenvalue inversion, an n-qubit controlled Ry rotation with angle ?i/2(n?1) conditioned on seeing |b1b2 . . . bn is applied for each possible n-bit binary string b1b2 . . . bn (2n values). The overall unitary is called a “uniformly controlled Ry rotation” in literature.
    Type: Application
    Filed: May 26, 2021
    Publication date: December 1, 2022
    Inventors: Romina YALOVETZKY, Dylan HERMAN, Pierre MINSSEN, Marco PISTOIA, Alexander BUTS, Shaohan HU
  • Publication number: 20220382830
    Abstract: 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.
    Type: Application
    Filed: May 26, 2021
    Publication date: December 1, 2022
    Inventors: Pierre MINSSEN, Romina YALOVETZKY, Dylan HERMAN, Marco PISTOIA, Alexander BUTS, Shaohan HU
  • Patent number: 11507397
    Abstract: Systems and methods for zero-footprint and safe execution of quantum computing programs are disclosed. According to one embodiment, in an electronic device comprising at least one computer processor, a method for cloud-based execution of quantum-computing programs may include: (1) receiving, from a user interface on a client device, a serialized file comprising a domain, an application, and an algorithm; (2) receiving, from the user interface, problem data and an identification of a quantum computing backend for executing the problem data; (3) instantiating a quantum program for execution and communicating the quantum program and the problem data to the quantum computing backend for execution; (4) receiving, from the quantum computing backend, an output of the execution; and (5) communicating the output to the user interface on the client device.
    Type: Grant
    Filed: November 5, 2020
    Date of Patent: November 22, 2022
    Assignee: JPMORGAN CHASE BANK, N.A.
    Inventors: Marco Pistoia, Robert Matles, Matthew Liste, David A. Carter, Apoorv Saxena, Alexander Buts, Dylan Herman
  • Publication number: 20220308984
    Abstract: Approaches presented herein enable fault detection. More specifically, implementation code of one or more functions is identified from source code. The implementation code of the one or more functions is converted to corresponding Abstract Syntax Trees (ASTs). The implementation code of the one or more functions is represented as a first plurality of sets of AST paths over the ASTs. Classification results for the one or more functions are generated with a classifier based on the first plurality of sets of AST paths for the implementation code of the one or more functions. Each of the classification results indicates a probability of having at least one fault in a corresponding function of the one or more functions. Fault detection results of the source code are generated based on the classification results.
    Type: Application
    Filed: March 29, 2021
    Publication date: September 29, 2022
    Inventors: Shiwan Zhao, Bo Yang, HongLei Guo, Zhong Su, Yunhui Zheng, Jim Alain Laredo, Alessandro Morari, Marco Pistoia
  • Patent number: 11436129
    Abstract: A test sequence generation method, system, and computer program product, include creating an ?-greedy policy from a recurrent neural network (RNN) model to prioritize an action from an action sequence.
    Type: Grant
    Filed: February 7, 2020
    Date of Patent: September 6, 2022
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Peng Liu, Marco Pistoia
  • Patent number: 11403196
    Abstract: A method for tracking user interactions with an application includes: storing the application in a memory of a mobile device, the application being associated with an instrumented widget and a library, the widget including an event logger; executing the application and the widget; receiving, through a user interface of the mobile device, an input corresponding to the event logger of the widget; logging, by the library, the input corresponding to the event logger of the widget in the memory of the mobile device; filtering a plurality of events, including the input corresponding to the event logger of the widget, to manage what data is reported to a monitor; and transmitting the input corresponding to the event logger of the widget to a server as monitored data.
    Type: Grant
    Filed: July 12, 2019
    Date of Patent: August 2, 2022
    Assignee: International Business Machines Corporation
    Inventors: Joseph W. Ligman, Marco Pistoia, Gegi Thomas, Stephen P. Wood
  • Patent number: 11394537
    Abstract: Systems and methods for processing and transmission of encrypted data are provided. The method includes: encrypting a first data set; encapsulating the encrypted first data set in a protective layer; and transmitting the encapsulated encrypted first data set to a destination over one or more communication channels. The encrypting is performed by using a homomorphic encryption (HE) technique. The encapsulating is performed by using a quantum key distribution (QKD) encapsulation technique to generate a QKD-protected layer. The communication channels may include a classical/non-quantum channel over which the QKD-encapsulated encrypted first set of data is transmitted and a quantum channel over which a quantum key distribution is conducted, or a single communication channel to conduct both.
    Type: Grant
    Filed: December 8, 2020
    Date of Patent: July 19, 2022
    Assignee: JPMORGAN CHASE BANK, N.A.
    Inventors: Farzam Toudeh-Fallah, Marco Pistoia, Antigoni Ourania Polychroniadou