Ionq, Inc.

University System of Maryland

Jpmorgan Chase Bank, N.a.

Pradeep Niroula

Yunseong Nam

Marco Pistoia

Andrii Maksymov

Wengang Zhang

Ruslan Shaydulin

Nikodem Grzesiak

Omar Amer

Andrew Lang

Niraj Kumar

Shouvanik Chakrabarti

A method may include: generating, by a plurality of auditor computer programs and a data curator computer program, a first random string using a first distributed randomness protocol; sending the first random string to a quantum party computer program; executing, by the quantum party computer program, a certified randomness protocol with a quantum randomness source using the first random string; receiving, from the quantum randomness source, a first quantum randomness; generating, by the auditor computer programs and the data curator computer program, a second random string using a second distributed randomness protocol; extracting, by the data curator computer program and using a randomness extractor, a second quantum randomness from the first quantum randomness using the second random string, wherein the second quantum randomness comprises a near-uniformly random string; and executing, by the data curator computer program, a differential privacy protocol using the second quantum randomness as additive noise.

Systems and methods for providing secure differential privacy using certifiable randomness protocols

A method of determining a pattern in a sequence of bits using a quantum computing system includes setting a first register of a quantum processor in a superposition of a plurality of string index states, encoding a bit string in a second register of the quantum processor, encoding a bit pattern in a third register of the quantum processor, circularly shifting qubits of the second register conditioned on the first register, amplifying an amplitude of a state combined with the first register in which the circularly shifted qubits of the second register matches qubits of the third register, measuring an amplitude of the first register and determining a string index state of the plurality of string index states associated with the amplified state, and outputting, by use of a classical computer, a string index associated with the first register in the measured state.

Accelerated pattern matching method on a quantum computing system

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 of performing a computational process includes transforming, a first register of a quantum processor to a charge encoded state in which charges of interacting particles to be simulated are encoded, transforming a second register of the quantum processor to a position encoded state in which positions of the interacting particles are encoded, performing a first phase shift operation, including shifting a phase of the first and second registers by kinetic energies of the interacting particles, performing a second phase shift operation, including shifting the phase of the first and second registers by pair-wise Coulomb potential energies of the interacting particles, measuring the phase of the first and second registers, transmitting the measured phase of the first and second registers to a classical computer, and the measured phase including a sum of the kinetic energies and the pair-wise Coulomb potential energies of the interacting particles.

Accelerated molecular dynamics simulation method on a computing system

A method of performing computation using a hybrid quantum-classical computing system comprising a classical computer and a quantum processor includes computing, by use of a classical computer, short-range inter-particle interaction energies and self-energies of a group of interacting particles, transforming the quantum processor from an initial state to a charge-position encoded state, applying Quantum Fourier transformation to the quantum processor, measuring an estimated amplitude of the Fourier transformed superposition state on the quantum processor, computing long-range inter-particle interaction energies based on the measured estimated amplitude of the Fourier transformed superposition state, and computing and outputting a sum of the short-range inter-particle interaction energies, the self-energies of the system, and the long-range inter-particle interaction energies as a total inter-particle interaction energies of the system.

Accelerated molecular dynamics simulation method on a quantum-classical hybrid computing system

A method of performing computation using an ion trap quantum computing system including a classical computer, a system controller, and a quantum processor includes computing, by the classical computer, a circuit that implements a selected set of gate operations, using one or more efficient arbitrary simultaneous entangling (EASE) gates, implementing, by the system controller, the computed circuit on the quantum processor, measuring, by the system controller, population of qubit states in the quantum processor, and outputting, by the classical computer, the measured population of qubit states in the quantum processor.

Quantum circuit construction with simultaneously entangling gates in trapped-ion quantum computers

A method of performing a quantum computation process includes mapping logical qubits to physical qubits of a quantum processor so that quantum circuits are executable using the physical qubits of the quantum processor and a total infidelity of the plurality of quantum circuits is minimized, wherein each of the physical qubits comprise a trapped ion, and each of the plurality of quantum circuits comprises single-qubit gates and two-qubit gates within the plurality of the logical qubits, calibrating two-qubit gates within a first plurality of pairs of physical qubits, such that infidelity of the two-qubit gates within the first plurality of pairs of physical qubit is lowered, executing the plurality of quantum circuits on the quantum processor, by applying laser pulses that each cause a single-qubit gate operation and a two-qubit gate operation in each of the plurality of quantum circuits on the plurality of physical qubits, measuring population of qubit states of the physical qubits in the quantum processor, and outputting the measured population of qubit states of the physical qubits.

Optimal calibration of gates in a quantum computing system

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.

Growing community of inventors

College Park, MD, United States of America

Pradeep Niroula