ИНТЕГРАЛЬНО-ОПТИЧЕСКАЯ СИСТЕМА ДЛЯ ПРОСТРАНСТВЕННОГО РАЗДЕЛЕНИЯ СКАЛЯРНЫХ ПУЧКОВ С ОРБИТАЛЬНЫМИ УГЛОВЫМИ МОМЕНТАМИ (ОУМ)

Изобретение относится к микроэлектронике, а именно к интегральным оптическим элементам, в частности к диэлектрическим метаповерхностям со сложным геометрическим профилем, которые могут быть использованы в области квантовых коммуникаций для защиты данных при передаче по каналам широкополосной связи посредством повышения размерности гильбертова пространства за счет использования скалярных пучков с орбитальным угловым моментом (ОУМ). Система для пространственного разделения скалярных пучков с ОУМ основана на использовании двух диэлектрических метаповерхностей, обладающих определенной морфологией поверхности и состоящих из кремниевых нанорезонаторов - нанодисков, обладающих магнитодипольным резонансом в ИК-диапозоне. При данных условиях оптической системой будет совершаться камфорное преобразование координат (преобразование, посредством которого полярные координаты переходят в линейные) и фазовая коррекция прошедшего через данную систему электромагнитного излучения с ОУМ. Таким образом, изобретение ...

Квантовая вычислительная система на основе нейтральных атомов

Изобретение относится к квантовой вычислительной системе на основе нейтральных атомов. Технический результат заключается в возможности ускоренного формирования упорядоченного квантового вычислительного регистра за счет реализации в системе функции активной стабилизации положения магнитооптической ловушки. Квантовая вычислительная система на основе нейтральных атомов включает соединенные оптической связью блок лазеров, сверхвысоковакуумную камеру, блок формирования упорядоченного квантового вычислительного регистра, измерительный блок, блок выполнения одно- и двухкубитных операций, блок стабилизации магнитооптической ловушки, блок управления магнитными полями, блок управления вычислителем, при этом сверхвысоковакуумная камера соединена с измерительным блоком, который соединен с блоком управления вычислителем, который в свою очередь связан с остальными упомянутыми блоками с обеспечением генерации последовательности управляющих электрических сигналов и временной синхронизации блоков в соответствии ...

СПОСОБ И СИСТЕМА РАСПРЕДЕЛЕНИЯ ВЫЧИСЛИТЕЛЬНЫХ ЗАДАЧ В ОБЛАЧНОЙ СРЕДЕ

Изобретение относится к способу и системе распределения вычислительных задач в облачной среде. Техническим результатом является повышение скорости выполнения задач. Способ содержит этапы, на которых: получают данные задачи, необходимые для выполнения вычислительной задачи; осуществляют анализ данных задачи для определения набора подзадач и параметров подзадач; определяют для по меньшей мере одной подзадачи типы вычислителей, на которых может быть выполнена подзадача, причем тип вычислителя указывает на то, что вычислитель является: гейтовым квантовым вычислителем; классическим вычислителем, эмулятором квантового вычислителя или адиабатическим квантовым вычислителем; на основе параметров подзадачи определяют параметры выполнения подзадачи для каждого типа вычислителя; сравнивают параметры выполнения подзадачи, полученные для каждого типа вычислителя, и выбирают тот тип вычислителя, параметры выполнения подзадачи которого имеют минимальные значения; определяют наличие очереди к типу вычислителя ...

МОНОЛИТНОЕ УСТРОЙСТВО ПЕРЕДАЧИ СИГНАЛОВ ДЛЯ ПРИМЕНЕНИЯ В ПРИЛОЖЕНИЯХ КРИОГЕННЫХ КВАНТОВЫХ ВЫЧИСЛЕНИЙ

Способ реализации устройства для построения вычислений и обработки информации

QUANTENSCHALTUNGSANORDNUNG

Eine Quantenschaltungsanordnung (100) mit zumindest einer Quantenschaltung (110) zum Ausführen einer Berechnung auf einem Quantencomputer, wobei die Quantenschaltungsanordnung (100) zumindest eine Suchstruktur (50), die zum Ermitteln eines Wertes einer vordefinierten Funktion auf Grundlage einer durch einen Satz von Qubits (12, 14, 16, 18) dargestellten Variablen ausgebildet ist, und eine Klasseneinteilungsstruktur (60) aufweist, die zum Erkennen einer vorgegebenen Klasse (64, 66) auf Grundlage der Variablen ausgebildet ist, wobei die Suchstruktur (50) dazu gestaltet ist, den Wert der vordefinierten Funktion auf Grundlage der Klasse (64, 66) zu ermitteln. Des Weiteren ein auf einem klassischen Computer implementierbares Verfahren zum Kompilieren einer Quantenschaltungsanordnung (100) mit zumindest einer Quantenschaltung (110) zum Ausführen einer Berechnung auf einem Quantencomputer.

Schaltkreis mit gekoppelten Qubits mit unterschiedlich anharmonischem Energiespektrum

Die Erfindung betrifft einen Schaltkreis mit einem ersten Qubit (2) und einem zweiten Qubit (3), mit einem Busresonator (6), der mit dem ersten Qubit (2) und dem zweiten Qubit (3) gekoppelt ist, dadurch gekennzeichnet, dass das erste Qubit (2) ein Qubit mit einem negativ anharmonischen Energiespektrum und das zweite Qubit (3) ein Qubit mit einem positiv anharmonischen Energiespektrum ist.Durch die Erfindung können eine hohe Gattertreue und eine hohe Gattergeschwindigkeit erzielt werden.

Quantum circuit arrangement

A quantum circuit arrangement (100) with at least one quantum circuit (110) for carrying out a computation on a quantum computer, the quantum circuit arrangement (100) comprising at least a lookup structure (50) being configured for determining a value of a predefined function based on a variable represented by a set of qubits (12, 14, 16, 18), and a binning structure (60) being configured to identify a predetermined bin (64, 66) based on the variable, wherein the lookup structure (50) is adapted to determine the value of the predefined function based on the bin (64, 66). Further a method implementable on a classical computer for compiling a quantum circuit arrangement (100) with at least one quantum circuit (110) for carrying out a computation on a quantum computer.

Job processing in quantum computing enabled cloud environments

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.

Quantum circuit synthesis using deterministic walks

Vertical superconducting capacitors for transmon qubits

A vertical q-capacitor (202, 302, 700, 1100, 1400, 1800) includes a trench (304, 502, 902, 1202, 1204, 1602) in a substrate (400) through a layer (602, 1302, 1304) of superconducting material (402). A superconductor is deposited in the trench (304, 502, 902, 1202, 1204, 1602) forming a first film on a first surface, a second film on a second surface, and a third film of the superconductor on a third surface of the trench (304, 502, 902, 1202, 1204, 1602). The first and second surfaces are substantially parallel, and the third surface in the trench (304, 502, 902, 1202, 1204, 1602) separates the first and second surfaces. A dielectric is exposed below the third film by etching. A first coupling is formed between the first film and a first contact, and a second coupling is formed between the second film and a second contact in a superconducting quantum logic circuit. The first and second couplings cause the first and second films to operate as the vertical q-capacitor (202, 302, 700, 1100 ...

Two-dimensional scalable superconducting qubit structure and cavity mode control method therefor

A two-dimensional scalable superconducting qubit structure and a cavity mode control method therefor. The two-dimensional scalable superconducting qubit structure comprises: a superconducting qubit chip, the superconducting qubit chip including a plurality of two-dimensionally distributed and scalable qubits; a capacitance part of each of the qubits has at least five arms distributed in a two-dimensional manner, two arms of the at least five arms in each of the qubits are respectively used for being connected to a reading coupling line and being connected to a control line, and the remaining at least three arms are coupled to adjacent qubits by means of coupling cavities. The structure facilitates for two-dimensional expansion, and is suitable for connecting a signal fan-out plate in the existing flip-chip bonding process or through silicon via technology; and when the flip-chip bonding process and through silicon via process are not provided or are thrown off, by making a plurality of ...

Low overhead quantum computation using lattice surgery

Methods, systems, and apparatus for performing low overhead quantum computations using lattice surgery. In one aspect, an apparatus includes a multi-qubit lattice defining a plurality of qubit rows and plurality of qubit columns, comprising: two or more separate row portions of rotated logical qubits, each row portion comprising a plurality of rotated logical qubits that are each adjacent to each other, each rotated logical qubit comprising: a plurality of data qubits, and a plurality of measure qubits; two or more separate row portions of inactive qubits, each row portion defining a plurality of inactive qubits; wherein: each row portion of rotated logical qubits is adjacent a row portion of inactive qubits.

Method and apparatus for performing a quantum computation

A method of performing a quantum computation includes providing a quantum system comprising a plurality of qubits. The method includes encoding a computational problem into a problem Hamiltonian of the quantum system. The problem Hamiltonian is a single-body Hamiltonian comprising a plurality of adjustable parameters. The encoding includes determining, from the computational problem, a problem-encoding configuration for the plurality of adjustable parameters. The method includes performing N rounds of operations, wherein N ≥ 2. Each round of the N rounds of operations includes determining a sequence of unitary operators, wherein each unitary operator in the sequence is a unitary operator being a unitary time evolution of the problem Hamiltonian, wherein the plurality of adjustable parameters of the problem Hamiltonian are in the problem-encoding configuration, or a unitary operator being a product of two or more short-range unitary operators. Each round of the N rounds of operations includes ...

Transmon qubits with trenched capacitor structures

A qubit includes a substrate, and a first capacitor structure having a lower portion formed on a surface of the substrate and at least one first raised portion extending above the surface of the substrate. The qubit further includes a second capacitor structure having a lower portion formed on the surface of the substrate and at least one second raised portion extending above the surface of the substrate. The first capacitor structure and the second capacitor structure are formed of a superconducting material. The qubit further includes a junction between the first capacitor structure and the second capacitor structure. The junction is disposed at a predetermined distance from the surface of the substrate and has a first end in contact with the first raised portion and a second end in contact with the second raised portion.

SUPERCONDUCTING CIRCUIT STRUCTURE, SUPERCONDUCTING QUANTUM CHIP AND SUPERCONDUCTING QUANTUM COMPUTER

The present application discloses a superconducting circuit structure, a superconducting quantum chip, and a superconducting quantum computer, which are related to a field of quantum computing. The specific implementation includes: a superconducting circuit structure, including: at 5 least three computational qubits; a bus qubit connected to the respective computational qubits, wherein couplings between two of the computational qubits connected by the bus qubit are equivalent; and coupler qubits disposed between the respective computational qubits and the bus qubit, to connect the respective computational qubits to the bus qubits, wherein the coupler qubit is configured to regulate coupling strength between the computational qubit and the bus qubit. Couplings between 0 any two computational qubits may be realized, so that an operation of a quantum gate between any two computational qubits is achieved, while crosstalk between computational qubits may be effectively suppressed. (FIG. 3) computational ...

QUANTUM PULSE DETERMINING METHOD, APPARATUS, DEVICE AND READABLE STORAGE MEDIUM

The present disclosure provides a quantum pulse determining method, apparatus, device and readable storage medium, where basic pulses corresponding to basic logic gates are set in advance, the method including: when manipulating a qubit according to a quantum logic gate, 5 splitting the quantum logic gate to obtain sub-logic gates; and searching for sub-pulses corresponding to the sub-logic gates among the basic pulses, and manipulating the qubit according to the sub-pulse. According to the solution provided by the present disclosure, basic pulses are set in advance in the method, apparatus, device and readable storage medium provided by the embodiments. When a qubit is to be manipulated, the quantum logic gate to be 0 used can be split into multiple sub-logic gates, and then sub-pulses corresponding to the sub logic gates are searched for among the basic pulses. Thus, sub-pulses that are read can be used directly to manipulate the qubit, which avoids the computing power consumed in generating ...

Oblivious carry runway registers for performing piecewise additions

Methods and apparatus for piecewise addition into an accumulation register using one or more carry runway registers, where the accumulation register includes a first plurality of qubits with each qubit representing a respective bit of a first binary number and where each carry runway register includes multiple qubits representing a respective binary number. In one aspect, a method includes inserting the one or more carry runway registers into the accumulation register at respective predetermined qubit positions, respectively, of the accumulation register; initializing each qubit of each carry runway register in a plus state; applying one or more subtraction operations to the accumulation register, where each subtraction operation subtracts a state of a respective carry runway register from a corresponding portion of the accumulation register; and adding one or more input binary numbers into the accumulation register using piecewise addition.

Wafer-scale integration of dopant atoms for donor- or acceptor-based spin qubits

Abstract Embodiments of the present disclosure describe a method of fabricating spin qubit device assemblies that utilize dopant-based spin qubits, i.e. spin qubit devices which operate by including a donor or an acceptor dopant atom in a semiconductor host layer. The method includes, first, providing a pair of gate electrodes over a semiconductor host layer, and then providing a window structure between the first and second gate electrodes, the window structure being a continuous solid material extending between the first and second electrodes and covering the semiconductor host layer except for an opening through which a dopant atom is to be implanted in the semiconductor host layer. By using a defined gate-first process, the method may address the scalability challenges and create a deterministic path for fabricating dopant-based spin qubits in desired locations, promoting wafer-scale integration of dopant-based spin qubit devices for use in quantum computing devices.

Inhomogeneous quantum annealing schedules

Methods and apparatus for performing quantum annealing using a quantum system. In one aspect, a method includes controlling the quantum system such that a total Hamiltonian characterizing the quantum system evolves from an initial quantum Hamiltonian to a problem quantum Hamiltonian, wherein controlling the quantum system comprises applying an inhomogeneous driving field to the quantum system to drive the quantum system across a quantum phase transition.

Nuclear spin quantum processing element and method of operation thereof

The present disclosure is directed a quantum processing element comprising: a semiconductor and a dielectric material forming an interface with the semiconductor; a dopant atom with nuclear spin of quantum number larger than 1/2 embedded in the semiconductor at a distance from the interface, at least one conductive electrode disposed in a manner such that there is at least a portion of dielectric material between the at least one conductive electrode and the dopant atom. The disclosure is also directed to a method of operating the quantum processing element comprising the steps of: applying a magnetic field to the dopant atom to separate the energies of the spin states associated with the nucleus of the dopant atom; applying a voltage to the at least one conductive electrode to generate an electric field gradient at a nucleus of the dopant atom; and encoding quantum information in the nuclear spin of the nucleus via the applied voltage.

Software-defined quantum computer

The disclosure describes various aspects of a software-defined quantum computer. For example, a software-defined quantum computer and an expandable/modular quantum computer are described. Also described are at least a software-defined quantum architecture, a resource manager workflow, a quantum compiler architecture, hardware description language configuration, levels of application programming interface (API) access points, and exception handling in software-defined quantum architecture.

Superconducting interposer for optical transduction of quantum information

A system for optical transduction of quantum information includes a qubit chip including a plurality of data qubits configured to operate at microwave frequencies, and a transduction chip spaced apart from the qubit chip, the transduction chip including a microwave-to-optical frequency transducer. The system includes an interposer coupled to the qubit chip and the transduction chip, the interposer including a dielectric material including a plurality of superconducting microwave waveguides formed therein. The plurality of superconducting microwave waveguides is configured to transmit quantum information from the plurality of data qubits to the microwave-to-optical frequency transducer on the transduction chip, and the microwave-to-optical frequency transducer is configured to transduce the quantum information from the microwave frequencies to optical frequencies.

HOLOGRAPHIC QUANTUM DYNAMICS SIMULATION

H217046-CA ABSTRACT A quantum computer controller receives a quantum circuit comprising circuit slices. The first slice comprises a past causal cone of a first system qubit wire at a fully evolved level of the circuit. An i-th slice contains all gates that are within a past causal cone of a system qubit wire that reaches the fully evolved level in slice i that are not in the past causal cone of a system qubit wire that reaches the fully evolved level in slice i-j. The controller causes execution of the i-th slice using the physical qubits; causes a physical qubit that was evolved along a system qubit wire to the fully evolved level via execution of the i-th slice to be reinitialized and reintroduced onto a system qubit wire at a base level of the i+m-th slice; and causes the quantum computer to use the physical qubit to execute the i+m-th slice. - 31 ¨ (536273) Date Recue/Date Received 2020-11-26 ...

HYBRID QUANTUM-CLASSICAL GENERATIVE MODELS FOR LEARNING DATA DISTRIBUTIONS

Hybrid quantum-classical generative models for learning data distributions are provided. In various embodiments, methods of and computer program products for operating a Helmholtz machine are provided. In various embodiments, methods of and computer program products for operating a generative adversarial network are provided. In various embodiments, methods of and computer program products for variational autoencoding are provided.

DEVICE-TAILORED MODEL-FREE ERROR CORRECTION IN QUANTUM PROCESSORS

Model-free error correction in quantum processors is provided, allowing tailoring to individual devices. In various embodiments, a quantum circuit is configured according to a plurality of configuration parameters. The quantum circuit comprises an encoding circuit and a decoding circuit. Each of a plurality of training states is input to the quantum circuit. The encoding circuit is applied to each of the plurality of training states and to a plurality of input syndrome qubits to produce encoded training states. The decoding circuit is applied to each of the encoded training states to determine a plurality of outputs. A fidelity of the quantum circuit is measured for the plurality of training states based on the plurality of outputs. The fidelity is provided to a computing node. The computing node determines a plurality of optimized configuration parameters. The optimized configuration parameters maximize the accuracy of the quantum circuit for the plurality of training states.

QUANTUM ANNEALING WITH OSCILLATING FIELDS

Embodiments herein implement quantum annealing with a driver Hamiltonian that uses oscillating fields to advantageously obtain a quantum speedup over classical computing techniques. For a many-body quantum system formed with qubits, the oscillating fields drive the qubits so as to independently modulate the magnitudes and/or directions of transverse terms of the driver Hamiltonian. In particular, embodiments provide a quantum speedup for two types of first-order phase transitions: the paramagnet-to-spin-glass transition, and transitions between distinct "bit string" states. The resulting speedup is robust against energy fluctuations e.g., 1/.function. noise), in contrast to other strategies like variable-rate annealing. Each oscillating field may be an oscillating electric field or magnetic field. The oscillating fields can be implemented with superconducting flux qubits by coupling oscillating fluxes and/or voltages to the flux qubits.

HYBRID QUANTUM-CLASSICAL COMPUTER FOR PACKING BITS INTO QUBITS FOR QUANTUM OPTIMIZATION ALGORITHMS

A hybrid quantum classical (HQC) computer, which includes both a classical computer component and a quantum computer component, implements improvements to the quantum approximate optimization algorithm (QAOA) which enable QAOA to be applied to valuable problem instances (e.g., those including several thousand or more qubits) using near-term quantum computers.

ERROR CORRECTED VARIATIONAL ALGORITHMS

Methods, systems and apparatus for approximating a target quantum state. In one aspect, a method for determining a target quantum state includes the actions of receiving data representing a target quantum state of a quantum system as a result of applying a quantum circuit to an initial quantum state of the quantum system; determining an approximate quantum circuit that approximates the specific quantum circuit by adaptively adjusting a number of T gates available to the specific quantum circuit; and applying the determined approximate quantum circuit to the initial quantum state to obtain an approximation of the target quantum state.

QUANTUM COMPUTER WITH IMPROVED CONTINUOUS QUANTUM GENERATOR

A hybrid quantum classical (HQC) computer which includes both a classical computer component and a quantum computer component performs generative learning on continuous data distributions. The HQC computer is capable of being implemented using existing and near-term quantum computer components having relatively low circuit depth.

METHOD AND SYSTEM FOR MULTIRAIL ENCODING OF QUANTUM BITS

A multirail-encoded qubit can be implemented using a quantum system having a state space that includes a number M of distinct modes, where M is an integer greater than 2. The M modes are logically partitioned into two disjoint subsets (or "bands"), with each mode assigned to exactly one of the bands. The multirail encoding is defined such that a state in which any one of the modes in the first band is occupied and all modes in the second band are unoccupied maps to a logical 0 state of the qubit, and a state in which any one of the modes in the second band is occupied and all modes of the first band are unoccupied maps to a logical 1 state. Systems and methods for generating, measuring, and operating on multirail-encoded qubits are disclosed.

QUANTUM CIRCUIT EMBEDDING BY SIMULATED ANNEALING

Mapping of logical qubits to physical qubits is provided. In various embodiments, a first candidate subgraph is selected from a hardware graph. The hardware graph represents a physical quantum circuit. The hardware graph comprises a plurality of nodes corresponding to physical qubits and a plurality of edges corresponding to coupling among the plurality of qubits. An accepted subgraph is determined by: setting the accepted subgraph to be the first candidate subgraph; mapping a quantum circuit comprising a plurality of logical qubits to the accepted subgraph; generating a second candidate subgraph of the hardware graph based on the accepted subgraph; mapping the quantum circuit to the second candidate subgraph; comparing fidelities of the accepted subgraph and the second candidate subgraph for the quantum circuit; if the fidelity of the second candidate subgraph is greater than the fidelity of the accepted subgraph, setting the accepted subgraph to be the second candidate subgraph; if the ...

METHODS AND SYSTEMS FOR QUANTUM COMPUTING

Described herein are methods, systems, and media for generating a quantum-ready or quantum-enabled software development kit (SDK) for a quantum computing system. Such methods may comprise accepting user input from an application at an application interface, which application is executed on a digital computer, and implementing one or more algorithms, at an algorithms layer, that may be solved heuristically or exactly depending on the requirements of the user input. The one or more algorithms may abstract away a complexity of the application; transforming the one or more algorithms from the application space into the one or more instructions in polynomial unconstrained binary optimization (PUBO) form. The one or more instructions may be executed in PUBO form at the common interface of the solver layer.

VARIABLE EMBEDDING METHOD AND PROCESSING SYSTEM

A variable embedding method, for solving a large-scale problem using dedicated hardware (1) by dividing variables of a problem graph (G1) into partial problems and by repeating an optimization process of the partial problems when an interaction of the variables of an optimization problem is expressed in the problem graph, includes: determining whether a duplicate allocation of the variables of the optimization problem to the vertices of the hardware graph is required when embedding at least a part of all the variables into the vertices of the hardware graph (S12); and selecting one of the variables requiring no duplicate allocation and embedding selected variable in one of the vertices of the hardware graph without using another one of the variables requiring the duplicate allocation as one of the variables of the partial problem (S13).

QUANTUM CIRCUIT SYNTHESIS USING DETERMINISTIC WALKS

There is provided a method for implementing an algorithm for forming, or synthesizing, quantum circuits on a system capable of performing the quantum circuit synthesis by using a deterministic walk (i.e. a pseudo-random walk with a random or pseudo-random starting point). In one implementation, the deterministic walk is performed using a parallel search algorithm. In an implementation of the parallel search algorithm, a user utilizes a programming language to write instructions for a compiler. Then, a meet in the middle approach is utilized to separate the circuit into two halves. Next, the parallel search technique is used to find a claw, or a pair, which satisfies the circuit analysis. Subsequently there is the production of a result and/or a synthesis of the circuit if the pair is found.

FLUX CONTROL OF QUBIT UNDER RESONANT EXCITATION

Systems and methods are provided for flux control of a qubit. A quantum system includes a microwave transmitter configured to provide a continuous microwave tone, and a qubit configured such that a portion of an energy spectrum of the qubit is responsive to an applied flux. The qubit also has an inductive element responsive to the continuous microwave tone to produce a Rabi oscillation within the qubit. A flux source is configured to apply a flux to the qubit.

two-dimensional clock structure for a nano quantum cellular automaton circuit and a design method thereof

Quantum nuclear main component analysis method

Method for developing a method for compiling a quantum circuit on a quantum processor and such a method

QUBIT HARDWARE FOR ELECTRONS ON HELIUM

Disclosed is a system and a method to use the system that includes a substrate to support a film of liquid helium and an electron subsystem confined by image forces in a direction perpendicular to the surface of the film, a side gate to electrostatically define a boundary of the electron subsystem, a trap gate to electrostatically define an electron trap located outside the boundary of the electron subsystem, and a load gate to selectively open and close access from the electron subsystem to the electron trap, wherein to open access to the electron trap is to apply a first load gate voltage to the load gate to allow the electrons to access the electron trap, and wherein to close access to the electron trap is to apply a second load gate voltage to the load gate to prevent the electrons from accessing the electron trap.

CROSSTALK MITIGATION FOR PCB TO DIE TRANSITION IN SUPERCONDUCTING DEVICES

The subject disclosure relates generally to a method of implementing magnetic shielding walls with specific respective dimensions to reduce crosstalk between transmission lines in wire-bonds for supercomputing chipsets. In one embodiment, the device comprises: a chip-set comprised of superconducting materials; at least one superconducting data line attached to chip-set dies by a set of wire bonds; and magnetic shielding walls that respectively isolate the set of wire bonds.

SYSTEM AND METHOD USING MULTILAYER QUBIT LATTICE ARRAYS FOR QUANTUM COMPUTING

A quantum computing (QC) system that includes a plurality of qubits arranged substantially in a plurality of substantially planar regions that are substantially parallel to one another, at least some of the substantially planar regions including two or more qubits and one or more qubits of each substantially planar region configured to interact with one or more qubits of at least one other substantially planar region.

PROCESSOR ELEMENT FOR QUANTUM INFORMATION PROCESSOR

Processor elements are described herein. A processor element comprises a silicon layer. The processor element further comprises one or more conductive electrodes. The processor element further comprises dielectric material having a non-uniform thickness, the dielectric material disposed at least between the silicon layer and the one or more conductive electrodes. In use, when a bias potential is applied to one or more of the conductive electrodes, the positioning of the one or more conductive electrodes and the non-uniform thickness of the dielectric material together define an electric field profile to induce a quantum dot at an interface between the silicon layer and the dielectric layer. Methods are also described herein.

SEPARABLE-STATE SIMULATION OF QUANTUM PROGRAM CODE

A method to digitally simulate an evolving quantum state of a qubit register of a quantum computer is enacted in a computer system. The quantum state is represented as an array of complex-valued amplitudes, where each amplitude is associated with an individual qubit of the qubit register, and where the quantum state is separable as a product of the individual quantum states of each qubit. One or more quantum-program instructions corresponding to a quantum circuit are received, and the amplitudes of the array are adjusted to reflect a change in the quantum state pursuant to execution of the quantum circuit, the change preserving the separability of the quantum state as a product of individual quantum states of each qubit. One or more of the adjusted amplitudes are then outputted computationally, in such form as to be receivable as input to a computer program.

A METHOD OF DETERMINING A STATE ENERGY

There is provided a method for determining an energy level of a physical system using a quantum computer, wherein the energy level of the physical system is described by the summation of a plurality of summands. The method comprises performing an energy estimation routine which comprises preparing an ansatz trial state using an arrangement of quantum gates, wherein the ansatz trial state has a trial state energy dependent on a trial state variable, and estimating an expectation value of each summand respectively. The estimating comprises constructing, based on the arrangement of quantum gates, an initial quantum circuit to operate on the ansatz trial state and further comprises performing a summand expectation value determination sub- routine a plurality of times in an iterative process. The energy estimation routine further comprises summing the expectation value estimates of each summand to determine an estimate for the trial state energy. The method further comprises determining the ...

MULTI-QUBIT CONTROL

This disclosure relates to evaluating and improving performance of a control implementation on a quantum processor comprising multiple qubits in the presence of noise. A noise model decomposes noise interactions described by a multi-qubit noise Hamiltonian into multiple contributory noise channels. Each channel generates noise dynamics described by a unique noise-axis operator. For a given control implementation, a unique filter function represents susceptibility of the multi-qubit system to the associated noise dynamics. The filter functions are based on a frequency transformation of the noise axis operator of the corresponding noise channel to thereby evaluate the performance of the control implementation. An optimised control sequence is based on the filter function to reduce the susceptibility of the multi-qubit system to the noise channels, thereby reducing the effective interaction with the multi-qubit noise Hamiltonian. The optimised control sequence controls the quantum processor ...

GENERATING QUANTUM COMPUTING CIRCUITS BY DISTRIBUTING APPROXIMATION ERRORS IN A QUANTUM ALGORITHM

Methods for generating quantum computing circuits by distributing approximation errors in a quantum algorithm are described. A method includes decomposing a quantum algorithm into quantum circuits. The method includes using at least one processor, automatically performing a step-wise decomposition of the quantum algorithm until the quantum algorithm is fully decomposed into the quantum circuits, where the automatically performing the step-wise decomposition results in a set of approximation errors and a set of parameters to instantiate at least a subset of the quantum circuits corresponding to the quantum algorithm, such that an overall approximation error caused by the automatically performing the step-wise decomposition is maintained below a specified threshold approximation error.

QUANTUM COMPUTING STRUCTURES USING ION TRAPS

Embodiments disclosed herein include systems and methods for producing ion traps for quantum computing. A method of obtaining quantum computations using an ion trap can include trapping a plurality of ions using a storage ring. The method can further include cooling the plurality of ions by irradiating each of the plurality of ions with coherent light. The method can include exciting one or more of the plurality of ions using a coherent light source and detecting an electromagnetic field response of the one or more ions from the coherent light source.

TWO-QUBIT GATES IMPLEMENTED WITH A TUNABLE COUPLER

Methods, systems and apparatus for implementing two-qubit gates using a tunable coupler. In one aspect, a method of implementing a two-qubit gate includes: applying a unitary transformation control signal to a tunable coupler arranged between a first data qubit and a second data qubit to obtain a target unitary transformation of the first data qubit and the second data qubit, w'herein the unitary transformation control signal is applied to the tunable coupler over a predetermined period of time to allow coupling between the first data qubit and the second data qubit through the tunable coupler.

QUANTUM CIRCUIT LEARNING DEVICE, QUANTUM CIRCUIT LEARNING METHOD, COMPUTER PROGRAM, AND RECORDING MEDIUM

Provided are a quantum circuit learning device, a quantum circuit learning method, a computer program, and a recording medium. The quantum circuit learning device comprises: a signal input unit for applying an input signal to a quantum circuit comprising a plurality of quantum bits; a signal acquisition unit for observing the state of the quantum bits of the quantum circuit, and acquiring an output signal based on the observed state; and an adjustment unit for adjusting a circuit parameter defining the circuit configuration of the quantum circuit by using a cost function that is set on the basis of the output signal acquired by the signal acquisition unit and a teaching signal for the output signal.

CONNECTION COMPONENT FOR A BRANCH FOR INDIVIDUAL ELECTRON MOTION

The invention relates to an electronic component (10) which is formed by a semiconductor component or a semiconductor-like structure with gate electrode arrangements (16, 18, 20) for the transport of a quantum dot (52). The electronic component (10) contains a substrate (12) comprising a two-dimensional electron gas or electron hole gas. Electrical contacts connect the gate electrode arrangements (16, 18, 20) to voltage sources. A first gate electrode arrangement (16) having gate electrodes (22, 24) is provided on a surface (14) of the electronic component in order to create a potential well (50) in the substrate (12). The gate electrode arrangement (16) has parallel electrode fingers (32, 34), said electrode fingers (32, 34) being alternately connected together at intervals which causes almost continuous transport of the potential well (50) through the substrate (12), a quantum dot (52) being translated together with this potential well (50) in one direction.

METHOD AND SYSTEM FOR EFFICIENT QUANTUM OPTICAL DESIGN USING NON-LINEAR MAPPINGS

The present invention relates generally to the design of quantum optical configurations and more specifically to using graph theory mapping and fidelity optimization to design optimal quantum optical configurations that have maximal fidelity between the designed optimal quantum optical configuration and the target quantum state. The target quantum state may include resource-efficient heralded multi-photonic quantum states, heralded high-dimensional entanglement, resource states for quantum gates, and high-dimensional multi-photonic GHZ states without ancilla photons.

VALIDATING AND ESTIMATING RUNTIME FOR QUANTUM ALGORITHMS

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.

SHUFFLE, ATTEND, AND ADAPT: VIDEO DOMAIN ADAPTATION BY CLIP ORDER PREDICTION AND CLIP ATTENTION ALIGNMENT

A method for performing video domain adaptation for human action recognition is presented. The method includes using (701) annotated source data from a source video and unannotated target data from a target video in an unsupervised domain adaptation setting, identifying and aligning (703) discriminative clips in the source and target videos via an attention mechanism, and learning (705) spatial-background invariant human action representations by employing a self-supervised clip order prediction loss for both the annotated source data and the unannotated target data.

SUPERCONDUCTING CIRCUITS FOR AN A-AND-NOT-B GATE HAVING AN EXCLUSIVE-OR GATE AND AN AND GATE

Superconducting circuits-based devices and methods for an A-and-not-B gate are provided. In one example, a circuit for an A-and-not-B gate including an output terminal, a first input terminal (ai) for receiving a first set of single flux quantum (SFQ) pulses, and a second input terminal (bi) for receiving a second set of SFQ pulses is provided. The circuit may further include a first stage (105) configured to perform an exclusive-OR operation on the first set of SFQ pulses received via the first input terminal and the second set of SFQ pulses received via the second input terminal to generate an exclusive-OR result. The circuit may further include a second stage (115), coupled to the first stage, configured to perform an AND operation on the exclusive-OR result and the first set of SFQ pulses received via the first input terminal and provide an output via the output terminal.

FREQUENCY GENERATION IN A QUANTUM CONTROLLER

A quantum controller comprises quantum control pulse generation circuitry, signal generation circuitry, and phase parameter generation circuitry. The phase parameter generation circuitry is operable to determine, based on an output of the time-tracking circuitry, a first value of a phase parameter to be used for generation of an oscillating signal. The signal generation circuitry is operable to, at a first time instant, begin generation of the oscillating signal at a first frequency for modulation of a first of the two quantum control pulses, and, at a second time instant, generate the oscillating signal at a second frequency, wherein the phase of the oscillating signal at the second time instant is determined by the value of the phase parameter such that the phase of the oscillating signal is as it would have been if the oscillating signal had been oscillating at the second frequency continuously since a reference time.

SEMICONDUCTOR-SUPERCONDUCTOR HYBRID DEVICE, ITS MANUFACTURE AND USES

A semiconductor-superconductor hybrid device (200) comprises a semiconductor (10), a superconductor (18), and a barrier (14) between the superconductor and the semiconductor. The device is configured to enable energy level hybridisation between the semiconductor and the superconductor. The barrier is configured to increase a topological gap of the device. The barrier allows for control over the degree of hybridisation between the semiconductor and the superconductor. Further aspects provide a quantum computer comprising the device, a method of manufacturing the device, and a method of inducing topological behaviour in the device..

VERIFIED QUANTUM PHASE ESTIMATION

Methods, systems, and apparatus for verified quantum phase estimation. In one aspect, a method includes repeatedly performing a experiment. Performing one repetition of the experiment includes: applying a second unitary to a system register of N qubits prepared in a target computational basis state; applying, conditioned on a state of a control qubit, a first unitary to the system register; applying an inverse of the second unitary to the system register and measuring each qubit to determine an output state of the system register; measuring the control qubit to obtain a corresponding measurement result m; and post-selecting on the target computational basis state by, in response to determining that the output state indicates that each qubit was in the target computational basis state prior to measurement, incrementing a first or second classical variable by (-1)m. Phases or expectation values of the first unitary are estimated based on the classical variables.

METHODS AND SYSTEMS FOR PROTECTING COHERENCE IN QUBITS

The disclosure is directed to devices, systems, and methods for a generation of a decoherence-protected subspace in a quantum system. The decoherence-protected subspace provides the quantum system with reduced sensitivity to environmental magnetic, electric, and thermal noises. Quantum information operation based on the quantum system can be performed while this decoherence-protected subspace is maintained.

QUANTUM COUPLER FACILITATING SUPPRESSION OF ZZ INTERACTIONS BETWEEN QUBITS

Devices and/or computer-implemented methods to facilitate ZZ cancellation between qubits are provided. According to an embodiment, a device can comprise a coupler device that operates in a first oscillating mode and a second oscillating mode. The device can further comprise a first superconducting qubit coupled to the coupler device based on a first oscillating mode structure corresponding to the first oscillating mode and based on a second oscillating mode structure corresponding to the second oscillating mode. The device can further comprise a second superconducting qubit coupled to the coupler device based on the first oscillating mode structure and the second oscillating mode structure.

Quantum system performing quantum channel estimation and method of modeling quantum channel

Disclosed herein is a method of performing quantum channel estimation. The method is performed by a first device of a transmission device, and may include a first quantum state transmission step of transmitting a first quantum state ρ including an N-qubit sequence to a second device of a reception device through a quantum channel, a second quantum state information reception step of receiving information about a second quantum state Φ(ρ) received by the second device through the quantum channel from the second device, and a quantum channel estimation step of estimating the quantum channel based on the received information about the second quantum state Φ(ρ).

SEMICONDUCTOR-SUPERCONDUCTOR HETEROSTRUCTURE

A device comprising: a portion of semiconductor; a portion of superconductor arranged to a enable a topological phase having a topological gap to be induced in a region of the semiconductor by proximity effect; and a portion of a non-magnetic material comprising an element with atomic number Z greater than or equal to 26, arranged to increase the topological gap in the topological region of the semiconductor.

CONNECTION SYSTEM FOR TIERED STAGES

A connection system for a quantum computer that employs constant impedance connectors with attenuation or filtering components or both embedded therein or within an adaptor removably insertable within an adaptor housing for use in a cryogenically cooled quantum computer. The connection system provides a higher density of cables traversing through a hermetic sealed top plate, and which are accessible to chill blocks to reduce the thermal energy from the signal lines. Attenuators or filter circuits are embedded in the constant impedance connector housings, or provided in adaptors that connect on each end to form mating constant impedance connections, in order to reduce signal strength as the signal progresses through the cryogenic environment and to remove extraneous electrical signal noise.

QUBIT PULSE CALIBRATION VIA CANARY PARAMETER MONITORING

Systems and techniques that facilitate qubit pulse calibration via canary parameter monitoring are provided. In various embodiments, a system can comprise a measurement component that can measure a canary parameter associated with a qubit control channel. In various embodiments, the system can further comprise a scaling component that can modify a plurality of parameters associated with the qubit control channel via a scaling factor. In various cases, the scaling factor can be based on the canary parameter. In various embodiments, the canary parameter can be a rotation error of a qubit driven by a microwave pulse transmitted along the qubit control channel. In various embodiments, the plurality of parameters can be amplitudes of a plurality of microwave pulses transmitted along the qubit control channel. In various embodiments, the plurality of parameters can be phases of a plurality of microwave pulses transmitted along the qubit control channel.

QUANTUM STATE MEASUREMENT LOGIC FACILITATING A QUANTUM STATE MEASUREMENT BACKEND PROCESS

Systems, computer-implemented methods, and computer program products to facilitate quantum state measurement logic used in a quantum state measurement backend process 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 stage control register component that defines a data processing function corresponding to at least one storage element in at least one stage of a quantum state measurement pipeline.

Discrete variational auto-encoder systems and methods for machine learning using adiabatic quantum computers

A computational system can include digital circuitry and analog circuitry, for instance a digital processor and a quantum processor. The quantum processor can operate as a sample generator providing samples. Samples can be employed by the digital processing in implementing various machine learning techniques. For example, the computational system can perform unsupervised learning over an input space, for example via a discrete variational auto-encoder, and attempting to maximize the log-likelihood of an observed dataset. Maximizing the log-likelihood of the observed dataset can include generating a hierarchical approximating posterior.

High fidelity waveform generator for qubit controller

A qubit controller includes an in-phase path and a quadrature path. A first combiner is configured to combine an output of the in-phase path with an output of the quadrature path to create a single sideband. There is a splitter configured to divide the single sideband into N portions, provide a first portion of the N portions to a qubit corresponding to the qubit controller, and provide each of the remaining N−1 portions to adjacent qubit controllers of a qubit cluster that includes the qubit corresponding to the qubit controller. A second combiner is configured to combine the first portion and N feedback signals received from the adjacent qubit controllers of the qubit cluster.

Approximate gate and supercontrolled unitary gate decompositions for two-qubit operations

Techniques are provided for improving quantum circuits. The technology includes approximately expanding, by a system operatively coupled to a processor, using zero to a number of applications of a super controlled basis gate, a target two-qubit operation, with the approximately expanding resulting in instances of the target two-qubit operation corresponding to the zero to the number of applications, and the target two-qubit operation is part of a source quantum circuit associated with a quantum computer. The system analyzes the instances and the super controlled basis gate, and automatically rewrites the source quantum circuit into a deployed quantum circuit based on the analyzing.

Efficient quantum adaptive execution method for quantum circuits

Systems and methods that can facilitate a quantum adaptive execution method based on previous quantum circuits and its intermediate results. This can generate an optimized adaptive compilation methodology for a specific backend and the previous quantum circuits dependents and thus redirect by the job dispatcher to the right quantum backend. Some of the quantum circuits can be dependent on other quantum circuits based on the intermediate results produced by the previous circuits. Hence, it is valuable that a system can manage the optimization of circuits based on its dependencies and by the results generated by the previous quantum circuits. In this way, the system can get an optimal result for a quantum circuit and inject it to the compiler unit to generate an adaptive compilation result. The resulted post-processing unit is the one in charge to apply this logic and manage the input/output of data to push it in the compiler units and the job dispatcher.

Quanton representation for emulating quantum-like computation on classical processors

The Quanton virtual machine approximates solutions to NP-Hard problems in factorial spaces in polynomial time. The data representation and methods emulate quantum computing on classical hardware but also implement quantum computing if run on quantum hardware. The Quanton uses permutations indexed by Lehmer codes and permutation-operators to represent quantum gates and operations. A generating function embeds the indexes into a geometric object for efficient compressed representation. A nonlinear directional probability distribution is embedded to the manifold and at the tangent space to each index point is also a linear probability distribution. Simple vector operations on the distributions correspond to quantum gate operations. The Quanton provides features of quantum computing: superpositioning, quantization and entanglement surrogates. Populations of Quantons are evolved as local evolving gate operations solving problems or as solution candidates in an Estimation of Distribution algorithm ...

AND gate based on ballistic electrons

An AND-gate device having a structure arms, a channel from a first arm and a second arm extends to a channel of a third arm. When a current from a first voltage flowing from a first electrode of the first arm to a second electrode of the second arm, a flow of electrons is generated that flows through the third arm channel from the channel of the first and second arms to the third arm channel. At least two input structures are positioned in series in the third arm. Each input structure includes a fin structure having a gate controlled by an individual voltage applied to an electrode which induces an electric-field structure that shifts by an amount of the voltage. The controllable gate opening changes a depletion width, causing an amount of flow of ballistic electrons to pass through the channel. A sensor detects the ballistic electrons.

Dispersive-resistive hybrid attenuator for quantum microwave circuits

A resistive component in a hybrid microwave attenuator circuit is configured to attenuate a plurality of frequencies in an input signal. The hybrid microwave attenuator circuit is further configured with a dispersive component to attenuate a second plurality of frequencies within a frequency range by reflecting off portions of the input signal at those frequencies that are within the frequency range. The resistive component and the dispersive component are arranged in a series configuration relative to one another in the hybrid microwave attenuator circuit.

Capacitively-shunted asymmetric DC-SQUID for qubit readout and reset

A tunable resonator is formed by shunting a set of asymmetric DC-SQUIDs with a capacitive device. An asymmetric DC-SQUID includes a first Josephson junction and a second Josephson junction, where the critical currents of the first and second Josephson junctions are different. A coupling is formed between the tunable resonator and a qubit such that the capacitively-shunted asymmetric DC-SQUIDs can dispersively read a quantum state of the qubit. An external magnetic flux is set to a first value and applied to the tunable resonator. A first value of the external magnetic flux causes the tunable resonator to tune to a first frequency within a first frequency difference from a resonance frequency of the qubit, the tunable resonator tuning to the first frequency causes active reset of the qubit.

Domain-distributed cryogenic signaling amplifier

A signal amplifier is distributed between first and second IC devices and includes a low-power input stage disposed within the first IC device, a bias-current source disposed within the second IC device and an output stage disposed within the second IC device. The output stage includes a resistance disposed within the second IC device and having a first terminal coupled to a drain terminal of a transistor within the input stage via a first signaling line that extends between the first and second IC devices.

Inverter Based on Electron Interference

Semiconductor devices includes third arms. A channel from the first and second arms extends to a channel of the third arm. When a current from a first voltage is flowing from the first arm to the second arm, a flow of ballistic electrons is generated that flow through the third arm channel from the channel of the first and second arms to the third arm channel. A fin structure located in the third arm channel and includes a gate. The gate is controlled using a second voltage over the fin structure, the fin structure is formed to induce an energy-field structure that shifts by an amount of the second voltage to control an opening of the gate that the flow of ballistic electrons pass through, which in turn changes a depletion width, subjecting the ballistic electrons to diffraction, and then interference.

System and Method for Loading an Ion Trap

Systems and methods for loading microfabricated ion traps are disclosed. Photo-ablation via an ablation pulse is used to generate a flow of atoms from a source material, where the flow is predominantly populated with neutral atoms. As the neutral atoms flow toward the ion trap, two-photon photo-ionization is used to selectively ionize a specific isotope contained in the atom flow. The velocity of the liberated atoms, atom-generation rate, and/or heat load of the source material is controlled by controlling the fluence of the ablation pulse to provide high ion-trapping probability while simultaneously mitigating generation of heat in the ion-trapping system that can preclude cryogenic operation. In some embodiments, the source material is held within an ablation oven comprising an electrically conductive housing that is configured to restrict the flow of agglomerated neutral atoms generated during photo-ablation toward the ion trap.

QUANTUM NETWORK NODE AND PROTOCOLS WITH MULTIPLE QUBIT SPECIES

The disclosure describes aspects of using multiple species in trapped-ion nodes for quantum networking. In an aspect, a quantum networking node is described that includes multiple memory qubits, each memory qubit being based on a 171Yb+ atomic ion, and one or more communication qubits, each communication qubit being based on a 138Ba+ atomic ion. The memory and communication qubits are part of a lattice in an atomic ion trap. In another aspect, a quantum computing system having a modular optical architecture is described that includes multiple quantum networking nodes, each quantum networking node including multiple memory qubits (e.g., based on a 171Yb+ atomic ion) and one or more communication qubits (e.g., based on a 138Ba+ atomic ion). The memory and communication qubits are part of a lattice in an atomic ion trap. The system further includes a photonic entangler coupled to each of the multiple quantum networking nodes.

CHIPS INCLUDING CLASSICAL AND QUANTUM COMPUTING PROCESSORS

An apparatus includes a substrate, a classical computing processor formed on the substrate, a quantum computing processor formed on the substrate, and one or more coupling components between the classical computing processor and the quantum computing processor, the one or more coupling components being formed on the substrate and being configured to allow data exchange between the classical computing processor and the quantum computing processor.

CO-PLANAR WAVEGUIDE FLUX QUBITS

A qubit device includes an elongated thin film uninterrupted by Josephson junctions, a quantum device in electrical contact with a proximal end of the elongated thin film, and a ground plane that is co-planar with the elongated thin film and is in electrical contact with a distal end of the elongated thin film, in which the thin film, the quantum device, and the ground plane comprise a material that is superconducting at a designed operating temperature.

REDUCTION OF SPONTANEOUS EMISSION AND THERMAL PHOTON NOISE IN QUANTUM COMPUTING MACHINES USING A GALVANICALLY GROUNDED FILTER

Protecting qubits of a quantum processor from spontaneous emission and thermal photon noise includes connecting a first port of a filter to a signal line of a readout resonator of a qubit circuit of a quantum processor. The filter has a passband including a readout resonator frequency associated with the readout resonator and a first stopband including a qubit transition frequency associated with the qubit circuit. A second port of the filter is connected to a measurement device. a signal line of the filter is galvanically connected to a reference ground in thermal contact to a stage of a cryostat. The galvanic connection further makes a thermal connection to an input signal line of the qubit circuit.

Isolation of frequency multiplexed microwave signals using cascading multi-path interferometric josephson isolators with nonoverlapping bandwidths

A cascading microwave isolator (cascade) includes a set of Josephson devices, each Josephson device in the set having a corresponding operating bandwidth of microwave frequencies. Different operating bandwidths have different corresponding center frequencies. A series coupling is formed between first Josephson device from the set and an nth Josephson device from the set. The series coupling causes the first Josephson device to isolate a signal at a first frequency from a frequency multiplexed microwave signal (multiplexed signal) in a first signal flow direction through the series coupling and the nth Josephson device to isolate a signal at an nth frequency from the multiplexed signal in the first signal flow direction through the series.

System and method for non-invasive large-scale qubit device characterization technique

According to an embodiment of the present invention, a system for non-invasively characterizing a qubit device includes a characterization probe chip. The characterization probe chip includes a substrate and a characterization resonator formed on a first surface of the substrate. The characterization resonator includes a superconducting stripline, and a superconducting antenna coupled to an end of the superconducting stripline, the superconducting antenna positioned to align with a qubit on the qubit device being characterized. The characterization probe chip also includes and a superconducting ground plane formed on a second surface of the substrate, the second surface opposing the first surface. In operation, the superconducting antenna is configured to capacitively couple the characterization resonator to the qubit aligned with the superconducting antenna for characterization of the qubit.

ACCELERATED MOLECULAR DYNAMICS SIMULATION METHOD ON A QUANTUM-CLASSICAL HYBRID 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.

PROVIDING CASCADING QUANTUM ENCRYPTION SERVICES IN QUANTUM COMPUTING SYSTEMS

Providing cascading quantum encryption services is disclosed. In one example, a first quantum computing device provides a plurality of encryption services that include one or more quantum encryption services and one or more classical encryption services. To encrypt a payload for transmission, the first quantum computing device selects a first encryption service from among the plurality of encryption services. The first quantum computing device then detects that the first encryption service is compromised. In response to detecting that the first encryption service is compromised, the first quantum computing device selects a second encryption service from among the plurality of encryption services, and encrypts the payload using the second encryption service. By automatically “cascading” from the first encryption service to the second encryption service in this manner, the first quantum computing device may ensure the secure communication of the payload to the second quantum computing device ...

SYSTEMS AND METHODS FOR QUANTUM BASED OPTIMIZATION OF A PERSONALIZED PORTFOLIO

Various systems and methods are provided for quantum computing based optimization of a personalized portfolio. One exemplary method may comprise identifying one or more filtered personalized portfolio optimization factor data based on one or more optimization factor data for the personalized portfolio, personalized portfolio owner feedback, QC algorithms, and algorithm performance information, selecting one QC algorithm for each filtered portfolio optimization factor data of the one or more filtered portfolio optimization factor data, utilizing the selected QC algorithm to optimize a personalized portfolio determination for each identified filtered personalized portfolio optimization factor data, and rebalancing the personalized portfolio based on the personalized portfolio determination.

Read out of quantum states of microwave frequency qubits with optical frequency photons

Techniques relate to reading a qubit coupled to a microwave resonator. A microwave signal at a microwave resonator frequency is input to the microwave resonator that couples to the qubit. A microwave readout signal from the microwave resonator is output to a microwave to optical converter. The microwave readout signal includes a qubit state of the qubit. The microwave to optical converter is configured to convert the microwave readout signal to an optical signal. In response to the optical signal being output by the microwave to optical converter, it is determined that the qubit is in a predefined qubit state. In response to no optical signal being output by the microwave to optical converter, it is determined that the qubit is not in the predefined qubit state.

Flux control of qubit under resonant excitation

Systems and methods are provided for flux control of a qubit. A quantum system includes a microwave transmitter configured to provide a continuous microwave tone, and a qubit configured such that transition energy of the qubit between a ground state of the qubit and a first excited state of the qubit is tunable via an applied flux. The qubit also has an inductive element responsive to the continuous microwave tone to produce a Rabi oscillation within the qubit. A flux source is configured to apply a flux to the qubit to selectively tune the transition energy of the qubit, such that the transition energy of the qubit can be tuned to a frequency of the Rabi oscillation or detuned from the Rabi oscillation.

Systems and methods for preservation of qubits

Embodiments of quantum ring oscillator-based coherence preservation circuits including a cascaded set of stages are described. Embodiments of such quantum ring oscillator-based coherence preservation circuits allow the internal (superpositioned) quantum state information of stored qubits to be preserved over long periods of time and present options for the measurement and potential correction of both deterministic and non-deterministic errors without disturbing the quantum information stored in the structure itself.

QUBIT FREQUENCY TUNING STRUCTURES AND FABRICATION METHODS FOR FLIP CHIP QUANTUM COMPUTING DEVICES

In an embodiment, a method includes forming a first chip having a first substrate and one or more qubits disposed on the first substrate, each of the one or more qubits having an associated resonance frequency. In an embodiment, the method includes forming a second chip having a second substrate and at least one conductive surface disposed on the second substrate opposite the one or more qubits, the at least one conductive surface having at least one dimension configured to adjust the resonance frequency associated with at least one of the one or more qubits to a determined frequency adjustment value.

OPTIMAL FAULT-TOLERANT IMPLEMENTATIONS OF HEISENBERG INTERACTIONS AND CONTROLLED-Zª GATES

The disclosure describes various aspects of techniques for optimal fault-tolerant implementations of controlled-Za gates and Heisenberg interactions. Improvements in the implementation of the controlled-Za gate can be made by using a clean ancilla and in-circuit measurement. Various examples are described that depend on whether the implementation is with or without measurement and feedforward. The implementation of the Heisenberg interaction can leverage the improved controlled-Za gate implementation. These implementations can cut down significantly the implementation costs associated with fault-tolerant quantum computing systems.

REDUCTION AND/OR MITIGATION OF CROSSTALK IN QUANTUM BIT GATES

Techniques facilitating reduction and/or mitigation of crosstalk in quantum bit gates of a quantum computing circuit are provided. 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 signal generation component that implements a control sequence that comprises a single pulse type for a first quantum bit and at least a second quantum bit of a quantum circuit. The computer-executable components can also comprise a coordination component that synchronizes a first pulse of a first channel of the first quantum bit and at least a second pulse of at least a second channel of the second quantum bit. The coordination component can simultaneously apply the first pulse to the first quantum bit and at least the second pulse to at least the second quantum bit.

Analog processor comprising quantum devices

Analog processors for solving various computational problems are provided. Such analog processors comprise a plurality of quantum devices, arranged in a lattice, together with a plurality of coupling devices. The analog processors further comprise bias control systems each configured to apply a local effective bias on a corresponding quantum device. A set of coupling devices in the plurality of coupling devices is configured to couple nearest-neighbor quantum devices in the lattice. Another set of coupling devices is configured to couple next-nearest neighbor quantum devices. The analog processors further comprise a plurality of coupling control systems each configured to tune the coupling value of a corresponding coupling device in the plurality of coupling devices to a coupling. Such quantum processors further comprise a set of readout devices each configured to measure the information from a corresponding quantum device in the plurality of quantum devices.

Tunable qubit coupler

Methods, systems and apparatus for implementing a tunable qubit coupler. In one aspect, a device includes: a first data qubit, a second data qubit, and a third qubit that is a tunable qubit coupler arranged to couple to the first data qubit and to couple to the second data qubit such that, during operation of the device, the tunable qubit coupler allows tunable coupling between the first data qubit and the second data qubit.

FREQUENCY MANAGEMENT FOR QUANTUM CONTROL

A system comprises quantum control interconnect circuitry configured to receive a plurality of fixed-frequency signals, a variable-frequency signal, a quantum control pulse, a quantum element readout pulse, and a quantum element return pulse. The circuitry is operable to upconvert the quantum control pulse using the fixed-frequency signals. The circuitry is operable to upconvert the readout pulse using the variable-frequency signal. The circuitry is operable to downconvert the return pulse using the variable-frequency signal.

Distributed quantum computing system

In a general aspect, user requests for access distributed quantum computing resources in a distributed quantum computing system are managed. In a general aspect, a job request for accessing a quantum computing resource is received. The job request includes a user id and a program. On authentication of a user associated with the job request, a job identifier is assigned to the job request, and a particular quantum computing resource is selected for the job request. The job request is individualized based on user permissions and pushed onto a queue to be processed for execution by the quantum computing resource.

Flux-tunable qubit architecture for multiplexing qubit control lines

A method of multiplexing control lines of a qubit array includes applying a qubit control signal to a single driveline. The qubit control signal is split on the single driveline between a first resonator and a second resonator. The first driveline is operative to control a first qubit, a second tunable qubit, a third qubit, and a fourth tunable qubit. The first qubit is coupled to the second tunable qubit by the first resonator. The third qubit is coupled to the fourth tunable qubit by the second resonator. A variation in amplitude of the qubit control signal is compensated by adjusting a frequency of the second tunable qubit and a frequency of the fourth tunable qubit.

SUPERCONDUCTING PHASE SHIFTER

Proposed is a phase shift introduction method, a structure, and a circuit device for eliminating or minimizing a risk associated with dissimilar materials, solving in principle a problem of mixing of a signal current and a control current that occurs due to DC connection of a phase shifter to a signal line, and stably and reliably providing a phase shift that is desired to be introduced without being adversely effected by noise generated by an ambient magnetic field, which is generated due to use of an external power supply. A structure according to the present invention includes a phase shifter 101 and a closed-loop circuit 103 that is directly used for computation or storage, and a quantum phase shift is generated in the closed-loop circuit 103 by using a fractional flux quantum captured by the phase shifter 101 that is DC-separated from the closed-loop circuit 103.

SYSTEM AND METHOD FOR COMMUNICATION BETWEEN QUANTUM CONTROLLER MODULES

A channel between quantum controller modules (e.g., pulse processors) is operable to communicate high speed data required for processing qubit states that may be distributed across a quantum computer. The latency of the communication channel is deterministic and controllable according to a system clock domain.

System and method to control quantum states of microwave frequency qubits with optical signals

A quantum computer includes a quantum computing system; a transducer disposed inside the quantum computing system, the transducer being configured to receive an optical control propagating wave and output a microwave control propagating wave; and a quantum processor comprising a plurality of qubits, the plurality of qubits being disposed in the quantum computing system, each qubit of the plurality of qubits being configured to receive at least a portion of the microwave control propagating wave to control a quantum state of each qubit of the plurality of qubits.

Quantum computing machine learning for security threats

Embodiments are disclosed for a method for a security model. The method includes generating a Bloch sphere based on a system information and event management (SIEM) of a security domain and a structured threat information expression trusted automated exchange of indicator information. The method also includes generating a quantum state probabilities matrix based on the Bloch sphere. Further, the method includes training a security threat model to perform security threat classifications based on the quantum state probabilities matrix. Additionally, the method includes performing a machine learning classification of the security domain based on the quantum state probabilities matrix.

Quantum Computational Systems

A computer-implemented method for encryption and decryption using quantum computational model is disclosed. Such a method includes providing a model of a lattice having a system of non-abelian anyons disposed thereon. From the lattice model, a first quantum state associated with the lattice is determined. Movement of non-abelian anyons within the lattice is modeled to model formation of first and second quantum braids in the space-time of the lattice. The first quantum braid corresponds to first text. The second quantum braid corresponds to second text. A second quantum state associated with the lattice is determined from the lattice model after formation of the first and second quantum braids has been modeled. The second quantum state corresponds to second text that is different from the first text.

Device and method for responding to influences of mind

Mental influence detectors and corresponding methods are useful for detecting an influence of mind and hidden or classically non-inferable information. An anomalous effect detector includes a source of non-deterministic random numbers, a converter to convert a property of numbers, a processor to accept converter output and to produce an output signal representative of an influence of mind. The processor output signal contains fewer numbers than the input. A quantum computer includes a physical source of entropy to generate output numbers; a source of test numbers; a measurement processor to accept output numbers and to measure a relationship between process numbers and at least one test number to produce an output representative of an influence of mind.

Methods of increasing fidelity of quantum operations

Systems and methods are provided for improving fidelity of a quantum operation on a quantum bit of interest. A controlled quantum gate operation, controlled by the quantum bit of interest, id performed on an ancillary quantum bit. An energy state of the ancillary quantum bit is measured to facilitate the improvement of the fidelity of the quantum operation.

Measurement-only topological quantum computation

Measurement-only topological quantum computation using both projective and interferometrical measurement of topological charge is described. Various issues that would arise when realizing it in fractional quantum Hall systems are discussed.

Quantum and digital processor hybrid systems and methods to solve problems

Quantum processors and classical computers are employed together to solve computational problems. The classical computer may include a parameter learning module that produces a set of parameters. The quantum processor may be configured with the set of parameters to define a problem Hamiltonian and operated to perform adiabatic quantum computation and/or quantum annealing on the problem Hamiltonian to return a first solution to the problem. The parameter learning module of the classical computer may then be used to revise the set of parameters by performing a classical optimization, such as a classical heuristic optimization. The quantum processor may then be programmed with the revised set of parameters to return a revised solution to the problem. The quantum processor may include a superconducting quantum processor implementing superconducting flux qubits.

Array of quantum systems in a cavity for quantum computing

A device includes a volume bounded by electromagnetically conducting walls, an aperture in a bounding wall of the electromagnetically conducting walls, a plurality of quantum systems disposed within the volume and an electromagnetic field source coupled to the volume via the aperture.

Superconducting latch system

A reciprocal quantum logic (RQL) latch system is provided. The latch system comprises an output portion that retains a state of the latch system, and a bi-stable loop that comprises a set input, a reset input and an output coupled to the output portion. A positive single flux quantum (SFQ) pulse on the set input when the latch system is in a reset state results in providing a SFQ current in the output portion representative of the latch system being in a set state.

Optical dynamic non-locality induction bit

A quantum dynamical non-locality device is provided for establishing a photon traveling along a path in a binary state. The device includes twin Mach-Zehnder interferometer (MZI), a shutter and a detector. The twin MZI includes first and second right-isosceles triangle prisms, corresponding first and second trombone mirrors, and corresponding first and second spacers. The prisms join at a beam-splitter interface. The mirrors reflect the photon by an offset substantially perpendicular to photon's travel direction. The spacers are respectively disposed between their respective prisms and mirrors to produce corresponding spatial gaps. The path through the prisms includes traversing spacers and gaps. The detector detects a quantum state of the photon after passing the prisms and the mirrors. The shutter switches to one of disposed within and removed therefrom the first gap. The shutter shifts said quantum state of the photon.

BINARY HALF-ADDER USING OSCILLATORS

A binary half-adder comprising first and second oscillators, each oscillator being connected to a first input and to a second input, the second oscillator being connected to the first oscillator, wherein the first oscillator is configured to oscillate if the first input is high or the second input is high, the second oscillator is configured to oscillate if the first and the second inputs are high, and wherein the connection between the second oscillator and the first oscillator is configured to suppress oscillation of the first oscillator if the second oscillator is oscillating. 11f. A binary half-adder comprising first and second oscillators , each oscillator being connected to a first input and to a second input , the second oscillator being connected to the first oscillator , wherein the first oscillator is configured to oscillate if the first input is high or the second input is high , the second oscillator is configured to oscillate if the first and the second inputs are high , and wherein the connection between the second oscillator and the first oscillator is configured to suppress oscillation of the first oscillator the second oscillator is oscillating.2. The binary half-adder of claim 1 , wherein each oscillator is configured to tend towards a stable non-oscillating state in the absence of an external input claim 1 , and is configured to oscillate at a limit-cycle in the presence of an external input which is above a threshold.3. The binary half-adder of claim 2 , wherein at least one of the oscillators is configured to tend towards a stable non-oscillating state if the external input exceeds an upper threshold.4. The binary half-adder of any of claim 1 , wherein the first oscillator and the second oscillator are electrical circuits.5. The binary half adder of claim 4 , wherein the first oscillator and the second oscillator comprise a plurality of FETs.6. The binary half-adder of claim 4 , wherein the first oscillator and the second oscillator are Fitzhugh ...

Quantum Well Device With Lateral Electrodes

An apparatus includes a substrate, a sequence of crystalline semiconductor layers on a planar surface of the substrate, and first and second sets of electrodes over the sequence. The sequence has a 2D quantum well therein. The first set of electrodes border opposite sides of a lateral region of the sequence and are controllable to vary a width of a non-depleted portion of the quantum well along the top surface. The second set of electrodes border channels between the lateral region and first and second adjacent lateral areas of the sequence and are controllable to vary widths of non-depleted segments of the quantum well in the channels. The electrodes are such that straight lines connecting the lateral areas via the channels either pass between one of the electrodes and the substrate or are misaligned to an effective [1 1 0] lattice direction of the sequence.

DATA TAG CONTROL FOR QUANTUM-DOT CELLULAR AUTOMATA

The present disclosure relates to methods and systems for data tag control for quantum dot cellular automata (QCA). An example method includes receiving data, associating a data tag with the data, communicating the data tag along a first wire-like element to a local tag decoder, reading instructions from the data tag using the local tag decoder, communicating the instructions to a processing element, communicating the data along a second wire-like element to the processing element, and processing the data with the processing element according to the instructions. A length of the first wire-like elements and a length of the second wire-like element are approximately the same such that communication of the instructions and the data to the processing element are synchronized. 1. An apparatus comprising:a plurality of quantum-dot cellular automata (QCA) cells to provide a route to communicate data; anda stage, wherein at least some of the plurality of QCA cells extend through the stage, the stage including:a processing component provided along the at least some of the plurality of QCA cells, the processing component configured to process the data; anda local tag decoder communicatively coupled to the processing component to read instructions from a data tag associated with the data and to, based on the instructions, instruct the processing component how to process the data.2. The apparatus of claim 1 , wherein the processing component includes a plurality of majority gates claim 1 , wherein a majority gate of the plurality of majority gates is arranged from a subset of QCA cells of the plurality of QCA cells.3. The apparatus of claim 2 , wherein the majority gate includes three input QCA cells of the subset of QCA cells to receive input data and an output QCA cell of the subset of QCA cells to provide output data.4. The apparatus of claim 4 , wherein a first majority gate of the plurality of majority gates is configured as an AND gate and a second majority gate of the ...

Chromophore based nanocircuits

Certain embodiments relate to systems and methods providing wires, circuits, or circuit elements comprised of one or more chromophores. The chromophores can be “tuned” to the critical edge between quantum order and quantum chaos providing long coherence times combined with quantum delocalization resulting in coherent transport of excitons. Such tuned chromophore systems provide coherent transport at room temperature.

METHOD OF CONTINUOUS PREDICTION OF PATIENT SEVERITY OF ILLNESS, MORTALITY, AND LENGTH OF STAY

A method for predicting a patient's outcome variable, such as a probability of mortality/recovery, includes accessing at least one of a plurality past patients' data fields including physiological and/or laboratory data, and a time of stay indicating how long each patient had been under care at the time. An outcome variable estimation algorithm is generated by data mining from a plurality of past patients' physiological and/or laboratory data, corresponding time of stay, and associated outcome variables. A current patient's outcome variable is determined from the current patient's physiological and/or laboratory data, the current time of stay, and the outcome variable estimation algorithm. 1. A patient information device comprising:a controller which receives physiological and/or laboratory data about a current patient from a patient monitoring device;a unit which determines a time of stay indicative of a time that the current patient has been under care; anda prediction unit which predicts an outcome variable by applying an outcome variable estimation algorithm to the current patient's physiological and/or laboratory data using the determined time of stay,2. The device according to claim I , wherein the outcome variables include at least one of a length of stay , a probability of mortality , and a need for intervention.3. The device according claim 1 , wherein the prediction unit predicts the outcome variable continuously in real time.4. The device according to claim 1 , wherein the outcome variable prediction algorithm is generated by:accessing at least one of a plurality past patients' data fields including physiological and/or laboratory data, and a time of stay indicating how long each patient had been under care at the time the physiological and/or laboratory data were generated and associated outcome variables from a clinical database;generating a outcome variable estimation algorithm from the plurality past patients physiological and/or laboratory data,. ...

Quantum Arithmetic On Two-Dimensional Quantum Architectures

2D nearest-neighbor quantum architectures for Shor's factoring algorithm may be accomplished using the form of three arithmetic building blocks: modular addition using Gossett's carry-save addition, modular multiplication using Montgomery's method, and non-modular multiplication using an original method. These arithmetic building blocks may assume that ancillae are cheap, that concurrent control may be available and scalable, and that execution time may be the bottleneck. Thus, the arithmetic building blocks may be optimized in favor of circuit width to provide improved depth existing nearest-neighbor implementations.

Systems and methods for superconducting flux qubit readout

Systems and methods for reading out the states of superconducting flux qubits may couple magnetic flux representative of a qubit state to a DC-SQUID in a variable transformer circuit. The DC-SQUID is electrically coupled in parallel with a primary inductor such that a time-varying (e.g., AC) drive current is divided between the DC-SQUID and the primary inductor in a ratio that is dependent on the qubit state. The primary inductor is inductively coupled to a secondary inductor to provide a time-varying (e.g., AC) output signal indicative of the qubit state without causing the DC-SQUID to switch into a voltage state. Coupling between the superconducting flux qubit and the DC-SQUID may be mediated by a routing system including a plurality of latching qubits. Multiple superconducting flux qubits may be coupled to the same routing system so that a single variable transformer circuit may be used to measure the states of multiple qubits.

Method and system for optimal decomposition of single-qubit quantum circuits using standard quantum gates

The current application is directed to methods and systems which produce a design for an optimal approximation of a target single-qubit quantum operation comprising a representation of a quantum-circuit generated from a discrete, quantum-gate basis. The discrete quantum-gate basis comprises standard, implementable quantum gates. The methods and systems employ a database of canonical-form quantum circuits, an efficiently organized canonical-form quantum-circuit, and efficient searching to identify a minimum-cost design for decomposing and approximating an input target quantum operation.

Prespacetime model for generating energy-momentum-mass relationship, self-referential matrix rules and elementary particles

A prespacetime model is formulated for generating energy-momentum-mass relationship, elementary particles and self-referential matrix rules through hierarchical self-referential spin structure in prespacetime. Key to the present model is: (1) generation of at least one primordial phase distinction in prespacetime, (2) formation of energy-momentum-mass relationship from said phase distinction; (3) formation of external and internal objects from said phase distinction; (4) matrixization of said energy-momentum-mass relationship into matrix rules; (5) matrixization of said internal and external objects into the external and internal wave functions of a particle in the dual world, and (6) interaction of said external object and said internal object through said matrix rules. In particular, working models for generating energy-momentum-mass relationship, self-referential matrix rules, elementary particles and composite particles are described as research aids, teaching tools and games. Further, working model for ether (aether) as a body or medium of prespacetime is also described as research aids and teaching tools.

Systems and devices for quantum processor architectures

Quantum processor architectures employ unit cells tiled over an area. A unit cell may include first and second sets of qubits where each qubit in the first set crosses at least one qubit in the second set. Each unit cell is positioned proximally adjacent at least one other unit cell. Within each unit cell, at least one qubit is longitudinally shifted with respect to at least one other qubit such that the longitudinally-shifted qubit crosses at least one qubit in a proximally adjacent unit cell. Communicative coupling between qubits is realized through respective intra-cell and inter-cell coupling devices. The longitudinal shifting of qubits and resultant crossing of qubits in proximally adjacent unit cells enables quantum processor architectures that can be better suited to solve certain problems.

Clock generation for a photonic quantum computer

A system for generating clock signals for a photonic quantum computing system includes a pump photon source configured to generate a plurality of pump photon pulses at a first repetition rate, a waveguide optically coupled to the pump photon source, and a photon-pair source optically coupled to the first waveguide. The system also includes a photodetector optically coupled to the photon-pair source and configured to generate a plurality of electrical pulses in response to detection of at least a portion of the plurality of pump photon pulses at the first repetition rate and a clock generator coupled to the photodetector and configured to convert the plurality of electrical pulses into a plurality of clock signals at the first repetition rate.

METHOD AND APPARATUS FOR MANAGING CLINICAL TRIALS AND RESEARCH

An approach is provided for managing clinical trials and research. The approach involves receiving, by a clinical trial management platform, an input via a user interface element of a user interface of the clinical trial management platform. The input specifies an edit or an update to a data record associated with tracking a clinical trial process. The approach also involves determining a workflow rule associated with the user interface element, which specifies criteria for initiating a capture of a timing metric and/or a performance metric associated with the clinical trial process. The approach further involves initiating the capture of the timing metric and/or the performance metric based on an evaluation of the input against the one or more criteria to update the data record. The approach further involves updating a plurality of user interface elements that are visible in the user interface based on the updated data record. 1. (canceled)2. A method of monitoring a plurality of clinical trial processes , comprising:receiving, via a user interface, an input specifying modification of a data record associated with one of the clinical trial processes, wherein the data record includes a plurality of fields corresponding respectively to a plurality of stages of the one clinical trial process;determining a particular stage among the plurality of stages corresponding to the data record;presenting, via the user interface, one or more user interface elements corresponding to the particular stage;assigning a workflow rule to an action based on the one or more user interface elements;evaluating the input according to the workflow rule to initiate the action;determining a performance metric for the action, wherein the performance metric specifies timing information and cost information for the particular stage;updating the data record based on the performance metric; andmodifying the one or more user interface elements of the user interface according to the updated data ...

QUBIT LEAKAGE ERROR REDUCTIONS

An arrangement, an apparatus, a quantum computing system, and a method are disclosed for reducing qubit leakage errors. In an example, an apparatus includes a qubit having a ground state and a plurality of excited states. The plurality of excited states include a lowest excited state. An energy difference between the ground state and the lowest excited state corresponds to a first frequency, and an energy difference between the lowest excited state and another excited state in the plurality of excited states corresponds to a second frequency. The apparatus also includes an energy dissipation structure to dissipate transferred energy, and a filter having a stopband and a passband. The filter is coupled to the qubit and to the energy dissipation structure. The stopband includes the first frequency and the passband includes the second frequency for reducing qubit leakage errors. 1. An apparatus for reducing qubit leakage errors comprising:at least one qubit having a ground state and a plurality of excited states, wherein the plurality of excited states includes a lowest excited state, wherein an energy difference between the ground state and the lowest excited state corresponds to a first frequency, and an energy difference between the lowest excited state and another excited state in the plurality of excited states corresponds to a second frequency;an energy dissipation structure configured to dissipate energy transferred to the energy dissipation structure; anda filter having at least one stopband and at least one passband, wherein the filter is coupled to the at least one qubit and to the energy dissipation structure, and wherein the at least one stopband includes the first frequency and the at least one passband comprises the second frequency.225. The apparatus according to claim 1 , wherein the energy dissipation structure comprises at least one normal metal—insulator—superconductor (NIS) junction.3. The apparatus according to claim 1 , wherein the energy ...

METHOD AND DEVICE FOR SETTING UP LONG RANGE QUANTUM COMMUNICATIONS NETWORKS

Described is a method of setting up a plurality of quantum communications links, forming a quantum network providing provably secure communications and internet services over intercontinental distances without requiring direct line of sight communication or the intermediate use of the entanglement resource of satellites. Also described is a quantum communicator device for use in this method. Two or more quantum memory units are disposed at a first location, an entangled link is set up between at least two of the quantum memory units, at least one of the quantum memory units sharing in the entangled link is physically transported to a second location. The quantum communicator device comprises communications nodes, an optical interface to set up entanglement to other devices and storage nodes, each node in the form of a quantum memory unit capable of storing quantum information for a desired length of time, i.e. weeks or longer. 1. A quantum communicator device , comprising:at least one communications node in the form of a quantum memory unit capable of maintaining an entangled link of at least a given desired fidelity to another communications or storage node for at least a first memory time, wherein the at least one communications node comprises an actively error corrected logical qubit,an optical interface coupled to the communications node to create an entangled link between one of the communications nodes of the device and a communications node of another device located in proximity to the quantum communicator device,at least one storage node in the form of a quantum memory unit capable of storing at least a qubit of quantum information for at least a second memory time, wherein the at least one storage node comprises an actively error corrected logical qubit,wherein each storage node can be coupled to at least one of the communications nodes in the sense that a multi-qubit operation may be performed between the nodes.2. The quantum communicator device of claim 1 ...

MAPPING TEMPERATURE DISTRIBUTION IN SUPERCONDUCTING DEVICES

Techniques regarding determining and/or analyzing temperature distributions experienced by quantum computer devices during operation 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 a region component that can define a plurality of temperature regions from a quantum computing device layout. The computer executable component can also comprise a map component that can generate a map that characterizes a temperature distribution by determining at least one temperature achieved within the plurality of temperature regions during an operation of the quantum computing device layout. 1. A system , comprising:a memory that stores computer executable components; a region component that defines a plurality of temperature regions from a quantum computing device layout; and', 'a map component that generates a map that characterizes a temperature distribution by determining at least one temperature achieved within the plurality of temperature regions during an operation of the quantum computing device layout., 'a processor, operably coupled to the memory, and that executes the computer executable components stored in the memory, wherein the computer executable components comprise2. The system of claim 1 , wherein the region component divides the quantum computing device layout into the plurality of temperature regions based on a position of a superconducting resonator comprised within the quantum computing device layout.3. The system of claim 1 , further comprising:a simulation component that determines an estimated frequency exhibited by a superconducting resonator of the quantum computing device layout at a reference temperature; anda measurement component that ...

ON-CHIP THERMOMETER FOR SUPERCONDUCTING QUANTUM COMPUTING DEVICES

Techniques regarding determining the temperature of one or more quantum computing devices are provided. For example, one or more embodiments described herein can comprise a system, which can comprise a temperature component that can determine a temperature of a superconducting resonator based on a frequency shift exhibited by the superconducting resonator due to a change in kinetic inductance with a change in temperature. 1. A system , comprising:a temperature component that determines a temperature of a superconducting resonator based on a frequency shift exhibited by the superconducting resonator due to a change in kinetic inductance with a change in temperature.2. The system of claim 1 , further comprising:a memory that stores computer executable components; anda processor, operably coupled to the memory, and that executes the computer executable components stored in the memory, wherein the temperature component is comprised within the computer executable components.3. The system of claim 1 , wherein the superconducting resonator is a superconducting transmission line positioned on a dielectric substrate claim 1 , and wherein the superconducting resonator comprises at least one member selected from a group consisting of: a pure type-I metal claim 1 , a pure type-II metal claim 1 , and a high thermal conductivity dielectric.4. The system of claim 3 , wherein the superconducting transmission line is selected from a second group consisting of a microstrip transmission line and a coplanar waveguide transmission line.5. The system of claim 1 , further comprising:a simulation component that simulates operation of the superconducting resonator to determine an estimated frequency exhibited by the superconducting resonator at a reference temperature, wherein a kinetic inductance of the superconducting resonator is known at the reference temperature.6. The system of claim 5 , further comprising:a measurement component that measures an operating frequency exhibited by the ...

Multistage Semiconductor Quantum Detector Circiut Incorporating Anticorrelation

A novel and useful multistage semiconductor quantum detector circuit incorporating an anticorrelation mechanism. The quantum structure has at least the first stage sensor of the detector merged into the quantum structure in order to minimize loading of the quantum structure. The merged quantum structure and detector sensor may be encapsulated in a metal cage in order to provide enhanced rejection of the environmental parasitic electric and/or magnetic fields. A double boot strapping detector front-end configuration substantially eliminates the loading coming from both the gate-source and the gate-drain parasitic capacitances of the first sensor device of the detector that is connected to the quantum structure. In addition, differential detection aids in rejecting leakage, noise, and correlated interference coupling. Both dummy referenced differential detection as well as self-referenced differential detection may be employed in the detector. Moreover, correlated double sampling is used after preamplification in the detector in order to further reject noise and perturbations in the system. 1. A quantum detector coupled to a quantum circuit , comprising:a main quantum sensor coupled to a main semiconductor quantum well whose output is to be detected for a presence or absence of a particle previously injected thereto, said main quantum sensor operative to generate a main sensor signal;a dummy quantum sensor coupled to a dummy semiconductor quantum well whereby no particle is injected thereto, said dummy quantum sensor operative to generate a dummy sensor signal; andan amplifier and conditioning circuit operative to detect the presence or absence of said particle at the output of said main quantum circuit in accordance with a difference between said main sensor signal and said dummy sensor signal.2. The quantum detector according to claim 1 , wherein said main quantum sensor and said dummy quantum sensor each comprise at least one source follower device.3. The quantum ...

LEARNING AGENT THAT FACILITATES THE EXECUTION OF A SUBSCRIPTION VEHICLE SERVICE BY IDENTIFYING VEHICLE SUGGESTIONS OR SUGGESTIONS THAT A CUSTOMER SWAP BASED ON DYNAMICALLY GATHERED INFORMATION

A system and method for dynamically obtaining and evaluating information to optimize the generation of vehicle suggestions for a customer. A profile based on an initial set of information received from a user is created. Metrics are generated based on the profile information. Upon receiving a vehicle request, the profile and the request are analyzed in view of available vehicles. A customer's response to the vehicle suggestion list, as well as events triggered by a perceived need for additional information result in the dynamic adjustment of the profile and thus, the generated metrics. 1. A method for a computer system to collect and evaluate information for generating one or more vehicle suggestions to a customer , the method comprising:creating a profile based at least in part on an initial set of information received from a user;generating one or more metrics based on the profile;receiving an event at the computer system; analyzing the request in view of the profile and a domain of available vehicles; and', 'generating a vehicle suggestion list or a swap suggestion comprising one or more vehicles, wherein the one or more vehicles are selected based at least in part on an association between attributes of the vehicle and the metrics;, 'in response to the event being a customer request for a vehicle initiating a campaign to obtain further information;', 'augmenting the profile to include the results of the campaign;', 'generating updated one or more metrics based on the augmented profile; and', 'continuing from the step of generating a vehicle suggestion list;, 'in response to receiving a rejection of the vehicle suggestion list initiating the delivery of the selected vehicle to the user; and', 'augmenting the profile to reflect the success of the selection;', 'generating updated one or more metrics based on the augmented profile; and', 'continuing from the action of receiving an event., 'in response to receiving a selection of a vehicle from the vehicle suggestion ...

LEARNING AGENT THAT FACILITATES THE EXECUTION OF A SUBSCRIPTION VEHICLE SERVICE BY DYNAMICALLY GENERATING MESSAGES AND PROCESSING RESPONSES TO GENERATE AND AUGMENT DATA THAT CAN THEN BE USED IN SUGGESTIONS TO CUSTOMERS

A system and method to generate and maintain interaction with a customer by evaluating customer initiated messages and telematics data to obtain information used to generate response messages and, further, generating conversation initiating messages autonomously in an effort to solicit response messages from a customer. 1. A method for a computer system to maintain a communication with a customer in an effort to solicit and collect information , the method comprising:receiving a customer message at the computer system, wherein the customer is associated with a subscription vehicle service;analyzing the message to identify one or more business topics to which the received message relates;identifying key data elements in the message;based on the business topics and the key data elements, generating a response message to be sent to the customer;analyzing the response message to generate a confidence score for the response message, wherein the confidence score is based on the customer's needs and present state inferred from prior data collected by the system from the customer and one or more telematics devices comprised within a vehicle asset associated with the customer;if the confidence score is above a first threshold value, delivering the response message to the customer; andif the confidence score is below a second threshold value, initiating a review of the response message and adjust the response message to have a higher confidence score and then delivering the adjusted response message to the customer.2. The method of claim 1 , wherein the action of generating a response message further comprises selecting one or more message components from a set of message components that are related to the business topic and one or more of the identified key data elements.3. The method of claim 1 , wherein each customer is associated with a customer profile and the action of generating a response message further comprises: selecting a message template from a set of message ...

DYNAMICAL ISOLATION OF A CRYOGENIC PROCESSOR

A device is dynamically isolated via a broadband switch that includes a plurality of cascade elements in series, wherein each cascade element comprises a first set of SQUIDs in series, a matching capacitor, and a second set of SQUIDs in series. The broadband switch is set to a passing state via flux bias lines during programming and readout of the device and set to a suppression state during device's calculation to reduce operation errors at the device. A device is electrically isolated from high-frequencies via an unbiased broadband switch. A device is coupled to a tunable thermal bath that includes a broadband switch. 1. A multiplexer microwave circuit comprising:a plurality of microwave paths, each microwave path communicatively coupling an input and a respective one of a plurality of outputs, each microwave path comprising at least one broadband switch; anda plurality of addressing lines, each addressing line communicatively coupled to one or more broadband switches.2. The multiplexer microwave circuit of claim 1 , wherein each broadband switch comprises: a respective first plurality of a number N of Superconducting Quantum Interference Devices (SQUIDs) superconductingly electrically communicatively coupled in series in a first arm, each SQUID of the first plurality of SQUIDs comprising at least one Josephson Junction;', 'a respective second plurality of a number M of SQUIDs superconductingly electrically communicatively coupled in series in a second arm, each SQUID of the second plurality of SQUIDs comprising at least one Josephson Junction; and', 'a respective matching capacitor, the matching capacitor physically positioned between the first arm and the second arm., 'a respective plurality of cascade elements superconductingly electrically communicatively coupled in series, each cascade element of the plurality of cascade elements comprising3. The multiplexer microwave circuit of claim 2 , wherein the total number N of SQUIDS in the first plurality of N SQUIDS ...

BATCHING WAVEFORM DATA

Methods and apparatus for generating waveforms for application in a quantum computing device. In one aspect, a system comprises a batch generator that receives experiment data sets defining respective experiments, each experiment data set comprising a set of waveforms defined by respective waveform data; determines unique waveforms; generates a corresponding set of respective waveform data that includes the respective waveform data for each unique waveform; generates, for each of the experiments, a waveform list that references the respective waveform data in the set of respective waveform data that corresponds to the waveforms in the set; and batch instructions that are executable by waveform generator hardware and that cause the waveform generator hardware to process each waveform list by selecting each referenced waveform data in the waveform list; and generate, in response to the selected waveform data, a waveform that is suitable for application in a quantum computing device. 1. A system implemented by one or more computers , comprising: receives as input a plurality of experiment data sets that each defines a respective experiment, each experiment data set comprising a set of waveforms, wherein each waveform in the set of waveforms is defined by respective waveform data;', 'determines, from the respective waveform data for each waveform in each experiment data set, unique waveforms;', 'generates, from the identified unique waveforms, a corresponding set of respective waveform data that includes the respective waveform data for each unique waveform;', 'generates, for each set of waveforms of the plurality of experiments, a waveform list that references the respective waveform data in the set of respective waveform data that corresponds to the waveforms in the set; and, 'a batch generator thatbatch instructions that are executable by waveform generator hardware and that cause the waveform generator hardware, upon execution, to 'generate, in response to the ...

RUNTIME QUANTUM-MEMORY REMAPPING

A quantum circuit program, when executed, implements a quantum circuit in quantum memory. The quantum-circuit program specifies addresses of quantum memory locations. A runtime quantum-memory remapper can route program instructions to the memory addresses they specify or to other memory locations between the time execution of the quantum circuit begins and the time that quantum-circuit execution is completed. The remapping can take place in response to a detection of a condition in which a memory location used by the quantum circuit becomes faulty, e.g., because it lost its quantum-state carrier. Remapping the quantum circuit allows its execution to continue despite the problem with quantum memory, and, in some cases, continue during the remedying of the remapping condition. 1. A runtime quantum-memory remapping process comprising:beginning execution of a quantum circuit using a first mapping of specified addresses to physical quantum memory locations, the specified addresses being specified by a quantum-circuit program that defines the quantum circuit, the first mapping routing a first specified address to a first physical memory location;after the beginning of execution, remapping the specified address to quantum-memory locations to implement a second mapping, the second mapping routing the first specified address to a second physical memory location different from the first physical memory location;after the remapping, continuing execution of the quantum circuit using the second mapping; andcompleting execution of the quantum circuit.2. The runtime quantum-memory remapping process of further comprising detecting a remapping condition claim 1 , the remapping being in response to the detecting the remapping condition.3. The runtime quantum-memory remapping process of further comprising claim 1 , prior to continuing execution of the quantum circuit claim 1 , transferring a quantum state of a first quantum-state carrier at the first physical memory location to a ...

SYSTEMS AND METHODS FOR INTELLIGENT CAPTURE AND FAST TRANSFORMATIONS OF GRANULATED DATA SUMMARIES IN DATABASE ENGINES

Embodiments may provide methods and systems for intelligent capture and fast transformation of granulated data summaries. An engine may be used to transform input data summaries into result sets representing query outcomes. The data summaries contain enough knowledge about the original data to accurately perform operations on the summaries without needing to access the original data. In an embodiment, the contents of data summaries are accessible via an SQL approximate engine which retrieves summaries stored on disk and utilizes them for its operations. Alternatively, the contents of data summaries are accessible via virtual tables which give users direct access to the summary contents and allow for the creation and implementation of algorithms to work with the data summaries independently from the SQL approximate engine. 1. A method for capture and transformation of granulated data summaries from a data set stored in a server implemented in a computer system comprising a processor , a memory adapted to store program instructions and data , and program instructions executable by the processor to perform:receiving, at the computer system, a query for at least one chunk of data stored in the server;generating, at the computer system, a response to the query including a result generated from at least one data summary of the at least one chunk of data without accessing the data itself; andtransmitting, at the computer system, the generated response to the query.2. The method of claim 1 , wherein the at least one summary of the at least one chunk of data takes the form of a relational data table with columns and rows.3. The method of claim 1 , wherein generating the response to the query comprises generating claim 1 , at the computer system claim 1 , a response summary from the at least one summary of the at least one chunk of data and generating the response to the query from the response summary.4. The method of claim 1 , wherein generating at least one data summary ...

METHOD AND APPARATUS OF MACHINE LEARNING USING A NETWORK WITH SOFTWARE AGENTS AT THE NETWORK NODES AND THEN RANKING NETWORK NODES

An apparatus and method are provided for rapidly ranking network nodes according to input ranking criteria. The links (i.e., first-order paths) between nodes are expressed in a first-order path matrix, which is used to generate nth-order path matrices as nth powers of the first-order path matrix and summed as a power series to generate a surrogate ranking operator (SRO) representing as a single matrix operation a sum over paths of all orders. Thus, in contrast to conventional ranking methods that require multiple recursive steps to account for the interrelatedness of linked nodes, a ranking is produced by multiplying the SRO by a state vector representing the input ranking criteria. 1. A web site ranking apparatus comprising:a network communications interface connected to an internet including websites and receive data elements from the websites,a memory configured to store a database of the websites, the database including a plurality of nodes representing the respective web sites and data elements received therefrom, and the plurality of nodes being respectively connected by a plurality of links representing connections between the websites; and determining a first-order path matrix including values representing one-link paths between pairs the plurality of nodes that are connected by a respective one of the plurality of links,', 'generate a surrogate ranking operator (SRO) using a power series of the first-order path matrix, and', 'rank the websites using a matrix product between a state vector of the input query and the SRO, and provide the ranked nodes to the user as a recommendation of best web sites satisfying the input query., 'processing circuitry configured to rank the web sites according to an input query of a user, the ranking of the websites being performed by'}2. A recommender apparatus comprising:a memory configured to store a database of a network, the database including a plurality of nodes containing respective data elements, and the plurality of ...

DENSITY-FUNCTIONAL THEORY DETERMINATIONS USING A QUANTUM COMPUTING SYSTEM

Techniques facilitating density-functional theory determinations using a quantum computing system are provided. A system can comprise a first computing processor and a second computing processor. The first computing processor can generate a density-functional theory determination. The second computing processor can input a quantum density into the density-functional theory determination. The first computing processor can be operatively coupled to the second computing processor. Further, the first computing processor can be a classical computer and the second computing processor can be a quantum computer. 1. A circuit , comprising:a first computing processor that generates a density-functional theory determination; anda second computing processor that inputs a quantum density into the density-functional theory determination generated by the first computing processor, wherein the first computing processor is operatively coupled to the second computing processor.2. The circuit of claim 1 , wherein the first computing processor is a classical computing processor claim 1 , and wherein the second computing processor is a quantum computing processor.3. The circuit of claim 1 , wherein the density-functional theory determination is an active density matrix claim 1 , and wherein the second computing processor provides an updated active density matrix based on the quantum density.4. The circuit of claim 1 , wherein the second computing processor iteratively communicates an updated active density matrix to the first computing processor.5. The circuit of claim 4 , wherein the first computing processor reoptimizes orbitals of the density-functional theory determination.6. The circuit of claim 1 , wherein the first computing processor determines inactive short-range contributions resulting in the density-functional theory determination.7. The circuit of claim 1 , wherein the second computing processor determines long-range contributions based on the density-functional theory ...

INCREMENTAL GENERATION OF QUANTUM CIRCUITS

A method includes detecting submission of a first quantum circuit for compilation, the first quantum circuit comprising a first set of quantum logic gates; generating a first gate index, the first gate index comprising an ordered table of a subset of the set of quantum logic gates, each quantum logic gate of the subset of quantum logic gates including a corresponding set of qubits acted on by the quantum logic gate; comparing the first gate index with a second gate index to determine a structural equality of the first quantum circuit and the second quantum circuit; and parameterizing, in response to determining a structural equality of the first quantum circuit and the second quantum circuit, a first set of parameters of a second set of quantum logic gates of the second quantum circuit with a second set of parameters of the first set of quantum logic gates. 1. A method comprising:detecting, in a first quantum circuit, a first set of quantum logic gates, each quantum logic gate of the first set of quantum logic gates including a corresponding set of qubits acted on by the quantum logic gate;determining, by comparing the first set of quantum logic gates with a second set of quantum logic gates of a second quantum circuit, that a structural equality exists between the first quantum circuit and the second quantum circuit; andparameterizing, responsive to determining the structural equality, a first set of parameters of a second set of quantum logic gates of the second quantum circuit with a second set of parameters of the first set of quantum logic gates.2. The method of claim 1 , wherein the second quantum circuit is a previously compiled quantum circuit.3. The method of claim 1 , further comprising:compiling, in response to determining a structural inequality of the first quantum circuit and the second quantum circuit, the first quantum circuit.4. The method of claim 3 , wherein a structural inequality includes a number of a specific type of quantum logic gate of the ...

QUANTUM-CIRCUIT PACKING

A quantum computer system packs quantum circuits into quantum memory so the circuits can be run concurrently. A quantum-circuit packer includes a resource mapper and a packing evaluator. The resource mapper characterizes the task of identifying candidate packings of pending quantum circuits as an integer linear problem (ILP), for which solutions are known. The packing evaluator applies an optimization criterion to select an optimum packing from the candidate packings. The optimum packing is run; the results are assigned to respective circuits that make up the packing. 1. A quantum-circuit-packing process comprising:identifying candidate packings, each candidate packing including one or more quantum circuits the required resources of which constitute respective disjoint subsets of resources of a quantum memory;selecting an optimal packing from the candidate packings based on an optimization criterion; andrunning the optimal packing on hardware including the quantum memory.2. The quantum-circuit-packing process of further comprising:after the running, measuring the qubits to obtain qubit measurements; andmapping qubit measurements from a single run on the quantum memory to respective quantum circuits of the optimal packing.3. The quantum-circuit-packing process of wherein the identifying includes:characterizing the identifying as an integer linear problem (ILP) regarding mappings of register resources required by the circuits to available register resources; andsolving the ILP to yield the candidate packings.4. The quantum-circuit-packing process of wherein the ILP is solved exactly.5. The quantum-circuit-packing process of wherein the ILP is solved heuristically.6. The quantum-circuit-packing process of wherein the quantum memory includes a qubit-site register populated by atoms.7. The quantum-circuit-packing process of wherein the atoms are of alkali or alkaline-earth elements.8. The quantum-circuit-packing process of further comprising claim 1 , prior to the ...

OPTICAL ISING MACHINES AND OPTICAL CONVOLUTIONAL NEURAL NETWORKS

A photonic parallel network can be used to sample combinatorially hard distributions of Ising problems. The photonic parallel network, also called a photonic processor, finds the ground state of a general Ising problem and can probe critical behaviors of universality classes and their critical exponents. In addition to the attractive features of photonic networks—passivity, parallelization, high-speed and low-power—the photonic processor exploits dynamic noise that occurs during the detection process to find ground states more efficiently. 1. A method of determining a ground state of an Ising model , the method comprising , at each of a plurality of time steps:encoding a plurality of optical signals with amplitudes representing an initial spin state of the Ising model;linearly transforming the plurality of optical signals to yield a plurality of linearly transformed optical signals;perturbing the plurality of linearly transformed optical signals to yield a plurality of perturbed signals;nonlinearly thresholding the plurality of perturbed signals to yield a plurality of nonlinearly thresholded signals; anddetermining the ground state for the Ising model from the plurality of nonlinearly thresholded signals.2. The method of claim 1 , wherein encoding the plurality of optical signals comprises:splitting a pulse from a pulsed laser into N optical signals, where N is a positive integer; andmodulating the amplitudes of the N optical signals to represent the initial spin state.3. The method of claim 1 , wherein encoding the plurality of optical signals comprises synchronously transmitting the plurality of optical signals to a linear transformation unit.4. The method of claim 1 , wherein linearly transforming the plurality of optical signals comprises performing a static linear transformation at each time step in the plurality of time steps.5. The method of claim 1 , wherein the Ising model is represented by a Hamiltonian:{'br': None, 'i': H', 'K', 'S', 'S', 'K, 'sup': '(K ...

UNIVERSAL CONTROL FOR IMPLEMENTING QUANTUM GATES

Methods, systems, and apparatus for implementing a unitary quantum gate on one or more qubits. In one aspect, a method includes the actions designing a control pulse for the unitary quantum gate, comprising: defining a universal quantum control cost function, wherein the control cost function comprises a qubit leakage penalty term representing i) coherent qubit leakage, and ii) incoherent qubit leakage across all frequency components during a time dependent Hamiltonian evolution that realizes the unitary quantum gate; adjusting parameters of the time dependent Hamiltonian evolution to vary a control cost according to the control cost function such that leakage errors are reduced; generating the control pulse using the adjusted parameters; and applying the control pulse to the one or more qubits to implement the unitary quantum gate. 1. A method for implementing a unitary quantum gate on one or more qubits , the method comprising:defining a universal quantum control cost function, wherein the control cost function comprises a total runtime penalty term and a qubit leakage penalty term representing qubit leakage during a time dependent Hamiltonian evolution that realizes the unitary quantum gate;adjusting parameters of the time dependent Hamiltonian evolution to vary a control cost according to the control cost function such that total quantum gate runtime and qubit leakage errors are reduced;generating a control pulse for a unitary quantum gate using the adjusted parameters; andapplying the control pulse to the one or more qubits to implement the unitary quantum gate.2. The method of claim 1 , wherein the universal control cost function further comprises a control constraint penalty term.3. The method of claim 1 , wherein the universal control cost function further comprises a gate fidelity penalty term.4. The method of claim 3 , wherein adjusting parameters of the time dependent Hamiltonian evolution comprises adjusting parameters of the time dependent Hamiltonian ...

METHOD AND DEVICE FOR CREATING A SYSTEM FOR THE AUTOMATED CREATION OF MACHINE LEARNING SYSTEMS

Computer-implemented method for creating a system, which is suitable for creating in an automated manner a machine learning system for computer vision. The method includes: providing predefined hyperparameters; determining an optimal parameterization of the hyperparameters using BOHB (Bayesian optimization (BO) and Hyperband (HB)) for a plurality of different training data sets; assessing all optimal parameterizations on all training data sets of the plurality of different training data sets with the aid of a normalized metric; creating a matrix, the matrix including the evaluated normalized metric for each parameterization and for each training data set; determining meta-features for each of the training data sets; optimizing a decision tree, which outputs as a function of the meta-features and of the matrix which of the optimal parameterization using BOHB is a suitable parameterization for the given meta-features. 1. A computer-implemented method for creating a system , which is suitable for creating , in an automated manner , a machine learning system for computer vision , the method comprising the following steps:providing predefined hyperparameters, the hyperparameters including at least one first parameter, which characterizes which optimization method is used, and one second parameter, which characterizes of what type of the machine learning system is;determining an optimal parameterization of the hyperparameters using BOHB (Bayesian optimization (BO) and Hyperband (HB)) for each single training data set of a plurality of different training data sets for computer vision;assessing all of the optimal parameterizations on all training data sets of the plurality of different training data sets using a normalized metric;creating a matrix, the matrix including the normalized metric for each of the optimal parameterizations and for each of the training data sets;determining meta-features for each of the training data sets, the meta-features characterizing at least ...

QUANTUM PULSE OPTIMIZATION USING MACHINE LEARNING

Techniques for facilitating quantum pulse optimization using machine learning are provided. In one example, a system includes a classical processor and a quantum processor. The classical processor employs a quantum pulse optimizer to generate a quantum pulse based on a machine learning technique associated with one or more quantum computing processes. The quantum processor executes a quantum computing process based on the quantum pulse. 1. A system , comprising:a classical processor that employs a quantum pulse optimizer to generate a quantum pulse based on a machine learning technique associated with one or more quantum computing processes; anda quantum processor that executes a quantum computing process based on the quantum pulse.2. The system of claim 1 , wherein the classical processor employs the quantum pulse optimizer to generate the quantum pulse based on historical data associated with the one or more quantum computing processes.3. The system of claim 1 , wherein the classical processor employs the quantum pulse optimizer to generate the quantum pulse based on learned data generated by the machine learning technique.4. The system of claim 1 , wherein the quantum pulse is a microwave pulse claim 1 , and wherein the classical processor that employs the quantum pulse optimizer to generate the microwave pulse based on the machine learning technique.5. The system of claim 1 , wherein the quantum pulse optimizer generates the quantum pulse based on one or more patterns associated with the one or more quantum computing processes.6. The system of claim 1 , wherein the quantum pulse optimizer generates the quantum pulse based on one or more patterns associated with quantum pulses employed by the one or more quantum computing processes.7. The system of claim 1 , wherein the quantum pulse optimizer generates the quantum pulse based on an arrangement of quantum pulses associated with the one or more quantum computing processes.8. The system of claim 1 , wherein the ...

Method for dimensional manipulation

A method for manipulating fractal forming information, also referred to as ct states, in a dimensional form of increasing and decreasing fractal compression roughly generated by the denominator of pi (fpix), n+1, and the formula 2f(x){circumflex over ( )}(2{circumflex over ( )}x) including transitional steps between those stepwise increases and decreases by altering the compression of decompression targeting fractal states of the composite dimensional features (next lower dimensional features) or the resulting dimensional features (next higher dimensional features). Steps include identifying the ct states which are to be manipulated, select a compression or decompression ct state component to change the selected ct states, adding the compression or decompression components to yield the new ct states and using pellet designs to maximize the efficiency of the reactions targeted. 120-. (canceled)21. A process for dimensional manipulation comprising the steps of (1) defining dimensional features as ct states defined by at least one iterated equation which separates compressing ct states from decompressing ct states wherein compressing is towards higher dimensional features and decompressing is the movement from higher dimensional features to lower dimensional features; (2) identifying a matrix containing a plurality of “ct states” and (3) changing at least one ct state to alter at least one dimensional feature of the matrix.22. The process of wherein the at least one iterated equation is at least one non-dimensional iterated equation generating quantum ct states and wherein compressing quantum ct states yields compressed ct states and lower compressed ct states between at least one of the compressed ct states and the quantum ct states.23. The process of wherein the at least one non-dimensional iterated equation generates the quantum informational states which change between positive and negative values according to a quantum count with a fuse length for each quantum ct ...

CONSTRUCTING AND PROGRAMMING QUANTUM HARDWARE FOR QUANTUM ANNEALING PROCESSES

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for constructing and programming quantum hardware for quantum annealing processes. 1. (canceled)2. A computer implemented method comprising:receiving, by a control system, a machine-readable machine learning optimization problem;encoding, by the control system, the machine-readable machine learning optimization problem into an energy spectrum of a Hamiltonian, wherein the Hamiltonian comprises a problem sub-Hamiltonian and a quantum governor sub-Hamiltonian, the encoding comprising determining values of parameters included in the problem sub-Hamiltonian;selecting values of parameters included in the quantum governor sub-Hamiltonian;initializing and programming, by the control system, quantum annealing hardware using i) the determined values of parameters included in the problem sub-Hamiltonian and ii) the selected values of parameters included in the quantum governor sub-Hamiltonian; andreceiving, by the control system and from the quantum annealing hardware, an output representing eigenstates of the Hamiltonian and corresponding energy spectra in machine-readable form, wherein the eigenstates and corresponding energy spectra encode a solution to the machine learning optimization problem.3. The method of claim 2 , wherein the parameters included in the problem sub-Hamiltonian parameters included in the quantum governor sub-Hamiltonian define a structure of the quantum annealing hardware.4. The method of claim 3 , wherein the structure of the quantum annealing hardware comprises couplings between superconducting units included in the quantum annealing hardware.8. The method of claim 2 , further comprising implementing claim 2 , by the programmed and initialized quantum annealing hardware claim 2 , a quantum annealing schedule to obtain the eigenstates of the Hamiltonian.9. The method of claim 8 , further comprising:providing, by the quantum annealing hardware and to the ...

Systems and methods for quantum processing of data

Systems, methods and aspects, and embodiments thereof relate to unsupervised or semi-supervised features learning using a quantum processor. To achieve unsupervised or semi-supervised features learning, the quantum processor is programmed to achieve Hierarchal Deep Learning (referred to as HDL) over one or more data sets. Systems and methods search for, parse, and detect maximally repeating patterns in one or more data sets or across data or data sets. Embodiments and aspects regard using sparse coding to detect maximally repeating patterns in or across data. Examples of sparse coding include L0 and L1 sparse coding. Some implementations may involve appending, incorporating or attaching labels to dictionary elements, or constituent elements of one or more dictionaries. There may be a logical association between label and the element labeled such that the process of unsupervised or semi-supervised feature learning spans both the elements and the incorporated, attached or appended label.

REAL TIME DEVELOPMENT OF AUTO SCORING ESSAY MODELS FOR CUSTOM CREATED PROMPTS

Systems and methods for automated custom training of a scoring model are disclosed herein. The method include: receiving a plurality of responses received from a plurality of students in response to providing of a prompt; identifying an evaluation model relevant to the provided prompt, which evaluation model can be a machine learning model trained to output a score relevant to at least portions of a response; generating a training indicator that provides a graphical depiction of the degree to which the identified evaluation model is trained; determining a training status of the model; receiving at least one evaluation input when the model is identified as insufficiently trained; updating training of the evaluation model based on the at least one received evaluation input; and controlling the training indicator to reflect the degree to which the evaluation model is trained subsequent to the updating of the training of the evaluation model. 1. A system for dynamic composite machine learning model selection , the system comprising:a memory comprising: a content library database containing a plurality of prompts and scoring data associated with each of the plurality of prompts; and a model database comprising a plurality of machine learning models for automated scoring of received user responses; and receive a first plurality of responses received from a plurality of users in response to providing of a prompt;', 'identify rules relevant to the received first plurality of responses;', 'select a first one of a plurality of machine learning models for scoring of the first plurality of responses according to the rules identified as relevant to the received plurality of responses;', 'auto-generate scores for the first plurality of responses with the selected first one of the plurality of machine learning models;', 'receive evaluation of the auto-generated scores;', 'identify a set of machine learning models via the rules relevant to the received first plurality of responses ...

EFFICIENT COOLING OF ION CHAINS FOR QUANTUM COMPUTATION

The disclosure describes various aspects of techniques for cooling a chain of ions to near the combined ground state that does not grow with the number of ions in the chain. By addressing each ion individually and using each ion to cool a different motional mode, it is possible to cool the motional modes concurrently. In an example, a third of the total motional modes can be cooled at the same time. In an aspect, the techniques include generating a sideband cooling laser beam for each ion in the ion chain, concurrently cooling two or more motional modes associated with the ions in the ion chain using the respective sideband cooling laser beam until each of the two or more motional modes reaches a motional ground state, and performing a quantum computation using the ion chain after the two or more motional modes have reached the motional ground state. 1. A method for cooling of an ion chain having multiple ions , comprising:generating a sideband cooling laser beam for each ion in the ion chain;concurrently cooling two or more motional modes associated with the ions in the ion chain using the respective sideband cooling laser beam until each of the two or more motional modes reaches a motional ground state; andperforming a quantum computation using the ion chain after the two or more motional modes have reached the motional ground state.2. The method of claim 1 , wherein concurrently cooling two or more motional modes includes repeating the following sequence a number of times:resetting the ions into a lower energy state using a repump laser beam;performing a motional dependent laser interaction with the generated sideband cooling laser beams to transfer a quanta of motion from the lower energy state of the ions to a higher energy state of the ions; andresetting the ions again into the lower energy state.3. The method of claim 2 , wherein the number of times the sequence is repeated is a predetermined number of times that ensures that all of the two or more motional ...

COST FUNCTION DEFORMATION IN QUANTUM APPROXIMATE OPTIMIZATION

Techniques for performing cost function deformation in quantum approximate optimization are provided. The techniques include mapping a cost function associated with a combinatorial optimization problem to an optimization problem over allowed quantum states. A quantum Hamiltonian is constructed for the cost function, and a set of trial states are generated by a physical time evolution of the quantum hardware interspersed with control pulses. Aspects include measuring a quantum cost function for the trial states, determining a trial state resulting in optimal values, and deforming a Hamiltonian to find an optimal state and using the optimal state as a next starting state for a next optimization on a deformed Hamiltonian until an optimizer is determined with respect to a desired Hamiltonian. 1. A system , comprising:a memory that stores computer executable components; a mapping component that maps a cost function associated with an optimization problem to a Hamiltonian, wherein the Hamiltonian has a known answer at a time that the Hamiltonian is mapped; and', 'a deformation component that deforms the Hamiltonian into a deformed Hamiltonian to find an optimal state, and uses the optimal state as a next starting state for a next optimization on the deformed Hamiltonian until an optimizer is determined with respect to a desired Hamiltonian., 'a processor that executes computer executable components stored in the memory, wherein the computer executable components comprise2. The system of claim 1 , further comprising a sampling component that samples from the optimal state corresponding to the optimizer to obtain one or more approximations to the optimization problem.3. The system of claim 1 , wherein the optimization problem is a combinatorial optimization problem.4. The system of claim 1 , further comprising a trial state and measurement component that generates trial states corresponding to the Hamiltonian.5. The system of claim 4 , wherein the trial state and ...

Compressed Unsupervised Quantum State Preparation with Quantum Autoencoders

A system and method include techniques for: generating, by a quantum autoencoder, based on a set of quantum states encoded in a set of qubits, a decoder circuit that acts on a subset of the set of qubits, a size of the subset being less than a size of the set; and generating a reduced-cost circuit, the reduced-cost circuit comprising: (1) a new parameterized quantum circuit acting only on the subset of the set of qubits, and (2) the decoder circuit. 1. A method comprising:generating, by a quantum autoencoder, based on a set of quantum states encoded in a set of qubits, a decoder circuit that acts on a subset of the set of qubits, a size of the subset being less than a size of the set; andgenerating a reduced-cost circuit, the reduced-cost circuit comprising: (1) a new parameterized quantum circuit acting only on the subset of the set of qubits, and (2) the decoder circuit.2. The method of claim 1 , further comprising:receiving the set of quantum states generated by at least one quantum circuit, having a depth D1 and a first cost function having a first cost value C1.3. The method of claim 2 , wherein generating the reduced-cost circuit comprises generating the reduced-cost circuit to act on the set of qubits claim 2 , the reduced-cost circuit having a second depth D2 and being associated with a corresponding second cost function having a second cost value C2 claim 2 , wherein at least one of the following is true: (1) C2 is less than C1; and (2) D2 is less than D1.4. The method of claim 3 , wherein C2 is less than C1 and D2 is less than D1.5. The method of claim 3 , wherein C2 less than C1.6. The method of claim 3 , wherein D2 is less than D1.7. The method of claim 3 , wherein the first cost function calculates a first energy cost and wherein the second cost function calculates a second energy cost.8. The method of claim 3 , wherein the first cost function represents a first function of a first number of gates within a circuit and wherein the second cost function ...

Quantum well stacks for quantum dot devices

Disclosed herein are quantum dot devices, as well as related computing devices and methods. For example, in some embodiments, a quantum dot device may include a (111) silicon substrate, a (111) germanium quantum well layer above the substrate, and a plurality of gates above the quantum well layer. In some embodiments, a quantum dot device may include a silicon substrate, an insulating material above the silicon substrate, a quantum well layer above the insulating material, and a plurality of gates above the quantum well layer.

QUANTUM TOMOGRAPHY AND PHOTON SOURCE OPTIMIZATION

A photon source module includes a plurality of photon sources, wherein each photon source is configured to non-deterministically generate one or more non-entangled or entangled photons in response to receiving a trigger signal. When two or more photon sources simultaneously generate photons in response to a trigger signal, one photon of a first photon pair is directed to a photon processing system and one photon of a second photon pair is directed to a photon analyzer. During repetitive operation, the photon analyzer analyzes photons from each of the plurality of photon sources to determine characteristics of each photon source and can use that information to direct the highest quality photons to the photon processing system. 1. A quantum computing system comprising:a photon processing system;a photon analyzer; and at least one photon source configured to discharge one or more photons per trigger signal; and', 'a photon multiplexer configured to direct the one or more discharged photons to the photon processing system or to the photon analyzer., 'a photon source module coupled to the photon processing system and to the photon analyzer, the photon source module including2. The quantum computing system of wherein the photon multiplexer directs the one or more discharged photons to the photon processing system when the photon source module discharges one photon per trigger signal.3. The quantum computing system of wherein the photon multiplexer directs one of the one or more discharged photons to the photon analyzer when the photon source module discharges two or more photons per trigger signal.4. The quantum computing system of wherein the photon processing system is a resource state generator.5. The quantum computing system of wherein the one or more photons are photons in an entangled state.6. The quantum computing system of wherein the at least one photon source is a plurality of spatially multiplexed photon sources.7. The quantum computing system of wherein the at ...

Superconducting flexible interconnecting cable connector

A superconducting flexible interconnecting cable connector for supercomputing systems is provided. The cable connector includes a base with a recessed area defined therein to receive superconducting flexible interconnecting cables and superconducting connecting chips to electrically connect the superconducting flexible interconnecting cables to each other. A cover is provided to cover the superconducting flexible interconnecting cables and the superconducting connecting chips when the cover is in a closed position. A compression device compresses the superconducting connecting chips together to secure the superconducting flexible interconnecting cables and the superconducting connecting chips inside the recessed area of the base when the cover is in the closed position.

QUANTUM COMPUTING DEVICES WITH MAJORANA HEXON QUBITS

Various embodiments of a modular unit for a topologic qubit and of scalable quantum computing architectures using such modular units are disclosed herein. For example, one example embodiment is a modular unit for a topological qubit comprising 6 Majorana zero modes (MZMs) on a mesoscopic superconducting island. These units can provide the computational MZMs with protection from quasiparticle poisoning. Several possible realizations of these modular units are described herein. Also disclosed herein are example designs for scalable quantum computing architectures comprising the modular units together with gates and reference arms (e.g., quantum dots, Majorana wires, etc.) configured to enable joint parity measurements to be performed for various combinations of two or four MZMs associated with one or two modular units, as well as other operations on the states of MZMs. 117.-. (canceled)18. A linear Majorana Hexon qubit , comprising:a topological superconducting nanowire partitioned into regions, including:three MZM topological superconducting regions, each having a respective first end at which a respective first Majorana zero mode resides and a respective second end, opposite the first respective end, where a respective second Majorana zero mode resides; andtwo s-wave superconducting regions that separate the three MZM topological superconducting regions from one another.19. The linear Majorana Hexon qubit of claim 18 ,wherein the s-wave superconducting regions are created by gating junctions between the MZM topological superconducting regions and the s-wave superconducting regions, andwherein the topological superconducting nanowire is located on a superconducting island having a charging energy sufficient to prevent quasiparticle poisoning.20. A network comprising two or more instances of the linear Majorana Hexon qubit of claim 18 ,wherein one or more neighboring instances of the linear Majorana Hexon qubit are selectively coupled to one another by superconductive ...

SYSTEMS AND METHODS FOR FABRICATION OF SUPERCONDUCTING INTEGRATED CIRCUITS

Various techniques and apparatus permit fabrication of superconductive circuits and structures, for instance Josephson junctions, which may, for example be useful in quantum computers. For instance, a low magnetic flux noise trilayer structure may be fabricated having a dielectric structure or layer interposed between two elements or layers capable of superconducting. A superconducting via may directly overlie a Josephson junction. A structure, for instance a Josephson junction, may be carried on a planarized dielectric layer. A fin may be employed to remove heat from the structure. A via capable of superconducting may have a width that is less than about 1 micrometer. The structure may be coupled to a resistor, for example by vias and/or a strap connector. 169.-. (canceled)70. A quantum computer comprising an integrated circuit , the integrated circuit comprising:a substrate;a quantum device comprising a loop of superconducting material interrupted by a Josephson junction, the Josephson junction comprising a Josephson junction trilayer overlying the substrate;a superconducting wiring layer overlying the Josephson junction trilayer, the superconducting wiring layer which comprises material that is superconductive at or below a critical temperature; anda passivating layer overlying the superconducting wiring layer.71. The quantum computer of claim 70 , wherein the passivating layer comprises at least one material selected from the group consisting of silicon nitride (SiN) or titanium nitride (TiN).72. The quantum computer of claim 70 , wherein the substrate comprises at least one material selected from the group consisting of silicon and sapphire.73. The quantum computer of claim 70 , wherein the Josephson junction trilayer comprises at least two layers of a metal that is superconductive at or below a critical temperature claim 70 , the at least two layers interrupted by an insulating layer.74. The quantum computer of claim 73 , wherein the at least two layers of a ...

Method for Generating Digital Quantum Chaotic Wavepacket Signals

A method for generating digital quantum chaotic orthonormal wavepacket signals includes the following steps: construct a N-dimensional Hermitian matrix Ĥ; calculate N eigen-wavefunctions φof a quantum Hamiltonian system with the Hamiltonian Ĥ by some numerical calculation methods, wherein the Hamiltonian is the Hermitian matrix Ĥ; extract some or all of the eigen-functions φwith obvious chaos features as quantum chaotic eigen-wavefunctions according to a chaos criterion; generate some semi-classical digital quantum chaotic wavepacket signals φ(n) with the same mathematical form as the quantum chaotic eigen-wavefunctions and length N from the selected quantum chaotic eigen-wavefunctions according to the mathematical correspondence between the classical signal and the wavefunction in quantum mechanics. By combining the quantum state chaotic transition theory and the classical time-frequency analysis, some semi-classical quantum chaotic wavepacket digital signals are generated according to the mathematical correspondence between the classical time-frequency signal and the wavefunction in quantum mechanics. 1. A method for generating digital quantum chaotic wavepacket signals , comprising the following steps:constructing an N×N Hermitian matrix Ĥ;{'sub': 'j', 'calculating N eigen-wavefunctions φof a quantum Hamiltonian system with a Hamiltonian by numerical calculation methods, wherein the Hamiltonian is the N×N Hermitian matrix Ĥ;'}{'sub': 'j', 'extracting a plurality of eigen-wavefunctions from N eigen-wavefunctions φas quantum chaotic eigen-wavefunctions according to a chaos criterion, wherein the plurality of eigen-wavefunctions have chaos features; and'}{'sub': 'j', 'generating a plurality of semi-classical digital quantum chaotic wavepacket signals φ(n) with a length N from the quantum chaotic eigen-wavefunctions according to a mathematical correspondence between a classical signal and a wavefunction in quantum mechanics, wherein the plurality of semi-classical ...

METHODS AND SYSTEMS TO FACILITATE ESTABLISHING A CONNECTION BETWEEN AN ACCESS-SEEKING DEVICE AND AN ACCESS GRANTING DEVICE

Disclosed herein is a method to facilitate establishing a connection between an access-seeking device and an access granting device. The method may include receiving, using a communication device, a Quantum Level Security (QLS) code from the access-seeking device. Further, the QLS code may be generated by the access-seeking device based on at least one QLS function and at least one parameter. Further, the method may include receiving, using the communication device, an independent QLS code generated by an access granting device based on the at least one QLS function and the at least one parameter. Further, the method may include comparing, using a processing device, the QLS code and the independent QLS code. Further, the method may include establishing, using the communication device, the connection between the access-seeking device and the access granting device based on a result of the comparing. 1. A method to facilitate establishing a connection between an access-seeking device and an access granting device , the method comprising:receiving, using a communication device, a Quantum Level Security (QLS) code from the access-seeking device, wherein the QLS code is generated by the access-seeking device based on at least one QLS function and at least one parameter;receiving, using the communication device, an independent QLS code generated by an access granting device based on the at least one QLS function and the at least one parameter;comparing, using a processing device, the QLS code and the independent QLS code; andestablishing, using the communication device, the connection between the access-seeking device and the access granting device based on a result of the comparing.2. The method of claim 1 , wherein at least one of the at least one QLS function and the at least one parameter is configured to generate a new QLS code corresponding to each time a service is accessed by the access-seeking device.3. The method of claim 2 , wherein at least one of the at least ...

Parametrically Activated Quantum Logic Gates

In a general aspect, a quantum logic gate is performed in a quantum computing system. In some cases, a pair of qubits are defined in a quantum processor; the pair of qubits can include a first qubit defined by a first qubit device in the quantum processor and a second qubit defined by a tunable qubit device in the quantum processor. A quantum logic gate can be applied to the pair of qubits by communicating a control signal to a control line coupled to the tunable qubit device. The control signal can be configured to modulate a transition frequency of the tunable qubit device at a modulation frequency, and the modulation frequency can be determined based on a transition frequency of the first qubit device. 198-. (canceled)99. A method comprising:obtaining operating parameters for one or more of a plurality of qubit devices in a quantum processor circuit, the plurality of qubit devices comprising a fixed-frequency qubit device and a tunable qubit device, the operating parameters based on measurements of the quantum processor circuit under an operating condition, the operating condition comprising a flux modulation applied to the tunable qubit device; andbased on the operating parameters, selecting gate parameters of a two-qubit quantum logic gate for application to a pair of qubits defined by the fixed-frequency qubit device and the tunable qubit device.100. The method of claim 99 , wherein the operating parameters include an effective coupling strength between the qubit devices during the flux modulation.101. The method of claim 99 , wherein the operating parameters include a transition frequency shift of the tunable qubit device under the flux modulation.102. The method of claim 99 , wherein the operating parameters are obtained for a range of modulation amplitude of the flux modulation.103. The method of claim 99 , wherein selecting gate parameters comprises selecting initial gate parameters claim 99 , and the method further comprises generating refined gate ...

METHOD AND SYSTEM FOR EXTRACTABLE RANDOMNESS SCALING IN QUANTUM RANDOM NUMBER GENERATORS

A method for entropy scaling in quantum random number generators, comprising dividing one spatial mode into multiple spatial modes, delaying each spatial mode, and recombing the spatial modes; detecting first temporal states with synchronisation to a photon generation time and encoding the first temporal states into first time bins; detecting second temporal states in an arbitrary clock, and encoding the second temporal states into second time-bins. The method comprises dividing a source of single photons into two paths in a first beam splitter and recombining the two paths in a next beam splitter, repeatedly, in a cascade of n beam splitters, consecutive beam splitters being separated by a length of fiber, yielding a number I=2of temporal states for each photon; detecting first temporal states by measuring a photon rate in a temporal window selected to measure photon arrival times, with synchronisation to a generation time of the photons, and encoding the first temporal states into first time bins, a number of the first temporal states being I=2; detecting second temporal states by measuring a photon rate in the selected temporal window, in absence of synchronisation to the generation time of the photon, and encoding the second temporal states into second time-bins, a number of the second time bins being N; thereby generating a state space for each photon of N×I. 1. A method for entropy scaling in quantum random number generators , comprising:{'sup': 'n', 'dividing a source of single photons into two paths in a first beam splitter and recombining the two paths in a next beam splitter, repeatedly, in a cascade of beam splitters, consecutive beam splitters being separated by a length of fiber, until a last beam splitter; yielding a number I=2of temporal states for each photon, where n is the number of beam splitters in the cascade;'}{'sup': 'n', 'detecting first temporal states by measuring a photon rate in a temporal window selected to measure photon arrival times, ...

IMAGE PROCESSING METHOD AND DEVICE, CLASSIFIER TRAINING METHOD, AND READABLE STORAGE MEDIUM

An image processing method, an image processing device, a training method and a computer-readable storage medium. The image processing method includes: extracting a characteristic vector in an image to be recognized; based on the characteristic vector of the image to be recognized, acquiring a predicted score value of the image to be recognized; and based on the predicted score value, determining a category of an image information of the image to be recognized; wherein the image to be recognized is a face image, and the image information is a facial expression. 1. An image processing method , comprising:extracting a characteristic vector in an image to be recognized;based on the characteristic vector of the image to be recognized, acquiring a predicted score value of the image to be recognized; andbased on the predicted score value, determining a category of an image information of the image to be recognized;wherein the image to be recognized is a face image, and the image information is a facial expression.2. The image processing method according to claim 1 , wherein the step of extracting the characteristic vector in the image to be recognized comprises:by using a Garbor filter, acquiring an image-feature response diagram of the image to be recognized; andextracting the characteristic vector of the image to be recognized from the image-feature response diagram;wherein the Garbor filter comprises a first quantity of dimensions and a second quantity of directions;the image-feature response diagram comprises features of the image information of the image to be recognized; andthe first quantity of dimensions are less than 4 dimensions.3. The image processing method according to claim 2 , wherein the method further comprises claim 2 , according to an accuracy rate of recognition of the image information by the Garbor filter with a third quantity of dimensions and a fourth quantity of directions claim 2 , selecting the first quantity of dimensions and the second ...

METHODS AND SYSTEMS FOR TRAINING A DECISION-TREE BASED MACHINE LEARNING ALGORITHM (MLA)

Methods and servers for of training a decision-tree based Machine Learning Algorithm (MLA) are disclosed. During a given training iteration, the method includes generating prediction values using current generated trees, generating estimated gradient values by applying a loss function, generating a first plurality of noisy estimated gradient values based on the estimated gradient values, generating a plurality of noisy candidate trees using the first plurality of noisy estimated gradient values, applying a selection metric to select a target tree amongst the plurality of noisy candidate trees, generating a second plurality of noisy estimated gradient values based on the plurality of estimated gradient values, generating an iteration-specific tree based on the target tree and the second plurality of noisy estimated gradient values, and storing, the iteration-specific tree to be used in combination with the current generated trees. 2. The method of claim 1 , wherein the decision-tree based MLA is being trained for performing one of a regression task and a classification task during an in-use phase of the decision-tree based MLA.3. The method of claim 1 , wherein the loss function if one of a convex loss function and a non-convex loss function.4. The method of claim 3 , wherein the non-convex loss function includes a 0-1 loss function.5. The method of claim 1 , wherein the first noise-inducing function is:{'br': None, 'sub': 'i', 'img': {'@id': 'CUSTOM-CHARACTER-00014', '@he': '3.22mm', '@wi': '3.56mm', '@file': 'US20220019902A1-20220120-P00001.TIF', '@alt': 'custom-character', '@img-content': 'character', '@img-format': 'tif'}, 'sup': '−1', 'ζ=(0,2ϵβ)'}{'sub': 'i', 'sup': th', 'th, 'img': {'@id': 'CUSTOM-CHARACTER-00015', '@he': '3.22mm', '@wi': '3.56mm', '@file': 'US20220019902A1-20220120-P00001.TIF', '@alt': 'custom-character', '@img-content': 'character', '@img-format': 'tif'}, 'wherein: ζis a given noise value to be added to iestimated gradient value from the ...

MAJORANA LOOP STABILIZER CODES FOR ERROR CORRECTION OF FERMIONIC QUANTUM SIMULATIONS

Methods, systems and apparatus for error correction of fermionic quantum simulation. In one aspect, a method includes representing a fermionic system as a graph of vertices and edges, where each vertex represents a fermionic system fermionic mode and each edge represents an interaction between two respective fermionic modes; allocating a qubit to each edge in the graph to form a qubit system; determining qubit operators that satisfy a set of fermionic commutation and dependence relations, where the qubit operators are non-uniform with respect to the graph vertices; determining stabilizer operators corresponding to products of quadratic Majorana operators on respective loops in the graph, where a common eigenspace of the defined stabilizer operators defines a code subspace that encodes states of the fermionic system to be simulated; and simulating the fermionic system by evolving the qubit system under a qubit Hamiltonian that includes the determined qubit operators and stabilizer operators. 1. A method for quantum simulation of a fermionic system , wherein the fermionic system is characterized by a fermionic Hamiltonian comprising elements from a group of quadratic Majorana operators of even weights , wherein the quadratic Majorana operators satisfy a set of commutation relations and a dependence relation that implies that the quadratic Majorana operators are not independent , the method comprising:representing the fermionic system as an interaction graph of vertices and edges, wherein each vertex represents a fermionic system fermionic mode and each edge represents an interaction between two respective fermionic modes;allocating a qubit to each edge in the interaction graph to form a qubit system;determining qubit operators that satisfy the set of commutation relations and the dependence relation, wherein the qubit operators are non-uniform with respect to the interaction graph vertices;determining stabilizer operators corresponding to products of quadratic ...

ERROR REDUCTION AND, OR, CORRECTION IN ANALOG COMPUTING INCLUDING QUANTUM PROCESSOR-BASED COMPUTING

The systems, devices, articles, and methods described herein generally relate to analog computers, for example quantum processors comprising qubits, couplers, and, or cavities. Analog computers, for example quantum processor based computers, are the subject of various sources of error which can hinder operation, potentially reducing computational accuracy and speed. Sources of error can be broadly characterized, for example as i) a background susceptibility do to inherently characteristics of the circuitry design, ii) as an h/J ratio imbalance, iii) bit flip errors, iv) fidelity, and v) Anderson localization, and various combinations of the aforesaid. 150.-. (canceled)51. A method of operation in a computational system that comprises both a quantum processor and at least one processor-based device communicatively coupled to one another , the quantum processor comprising a plurality of qubits and a plurality of coupling devices , wherein each coupling device is operable to provide controllable communicative coupling between two of the plurality of qubits , the method comprising:producing a problem graph representation of a first problem;identifying each of the qubits that will be operated as a problem qubit, the problem qubit to be used when generating solutions to a first problem;for each of at least a number of the qubits that will be operated as problem qubits, identifying a respective ancilla qubit to apply an external flux bias to the respective problem qubits;embedding the problem graph representation of the first problem into the problem qubits of the quantum processor;applying an external flux bias to each problem qubit to at least partially reduce an h/J ratio misbalance of the respective qubit; andevolving the quantum processor with the problem graph representation embedded therein to generate solutions to the first problem via the quantum processor.52. The method of claim 51 , further comprising:identifying a problem type of a first problem;determining ...

ARTIFICIAL INTELLIGENCE (AI) BASED PAYMENTS PROCESSOR

An Artificial Intelligence (AI) based payments processing system analyzes data from a user's purchase invoice to identify a combination of payment modes to be used to pay for the user's purchases thereby maximizing the savings to the user while accounting for the user preferences. A savings oriented model including a mix and match model and a dynamic decision tree scoring model generates a savings based best offer suggesting the payment modes to be used by analyzing the user's purchases based on the offers associated with the purchased products. A user behavior model generates a user behavior based best offer by further accounting for user preferences. Based on the user's autopay settings, the payments processing system may automatically initiate payment for the user's purchases or may display the best offers to the user before initiating the payments. 2. The AI-based payments processing system of claim 1 , wherein to enable payments for the user's purchase the processor is to further:determine if the user behavior based best offer is the same as the savings based best offer in terms of the considerations and the corresponding payment modes.3. The AI-based payments processing system of claim 2 , wherein the user behavior based best offer is the same as the savings based best offer and the processor is to further:determine if the user has enabled frictionless payment option from the user profile; andtrigger automatic payment for the user's purchase using the payment modes set out in one of the user behavior based best offer and the savings based best offer if the user has enabled the frictionless payment option.4. The AI-based payments processing system of claim 2 , wherein if the user behavior based best offer is not identical to the savings based best offer claim 2 , to enable payments for the user's purchase the processor is to further:enable presentation of the user behavior based best offer and the savings based best offer for selection to the user via a user ...

EFFICIENT PIPELINED ARCHITECTURE FOR SUPERCONDUCTING SINGLE FLUX QUANTUM LOGIC CIRCUITS UTILIZING DUAL CLOCKS

An SFQ circuit system includes at least one SFQ block having a plurality of SFQ logic gates. Characteristically, at least a portion of the SFQ logic gates are arranged in series. The SFQ circuit system includes a timing system configured to provide a first set of inputs and collect a first set of outputs of the at least one SFQ block at a rate defined by a slow clock frequency while the SFQ logic gates are clocked at a fast clock frequency. Advantageously, the rate is sufficiently slow to allow the first set of inputs to propagate through all levels of the SFQ logic gates to produce the first set of outputs of the at least one SFQ block without colliding with a second set of inputs to the at least one SFQ block. 1. A single flux quantum (“SFQ”) circuit system comprising:at least one SFQ block that includes a plurality of SFQ logic gates, at least a portion of the SFQ logic gates arranged in series; anda timing system configured to provide a first set of inputs and collect a first set of outputs of the at least one SFQ block at a first rate defined by a slow clock frequency while the SFQ logic gates are clocked at a second rate defined by a fast clock frequency wherein the first rate is sufficiently slower than the second rate to enable the first set of inputs to be presented one or more times to the at least one SFQ block at the second rate and the first set of inputs to propagate through all levels of the SFQ logic gates to produce the first set of outputs of the at least one SFQ block without colliding with a second set of inputs to the at least one SFQ block.2. The SFQ circuit system of wherein the ratio of the second rate to the first rate is lower bounded by the maximum difference of path lengths from primary inputs of the at least one SFQ block to input pins of any SFQ logic gate in the at least one SFQ block.3. The SFQ circuit system of wherein the ratio of the second rate to the first rate is equal to either X+1 or X+2 where X denotes the maximum difference ...

Method and apparatus for producing quantum entanglement and non-local effects of substances

A method and apparatus are disclosed which produce quantum entanglement and non-local effects of various substances on responsive targets such as biological and/or chemical systems through quantum entanglement. In one broad embodiment, the apparatus includes a quantum entanglement generating source, said source emitting a plurality of quantum-entangling members such as photons when said source operates; and a substance disposed adjacent to said source, said substance being responsive to said members; such that when said source emits said members which pass through said substance and a biological system, said members first quantum-entangle with quantum entities in said substance, then travel to said biological system such as a human body and subsequently entangle with quantum entities inside the biological system producing non-local effect of the substance on said biological system through quantum entanglement. Also described are a number of implementations and methods of use of the apparatus, including the quantum entanglement generating source being photons produced a magnetic coil connected to a driving device, laser or microwave oven and the use being therapeutic, communicational or recreational. 1. A method of producing a plurality of quantum entanglements between a first plurality of quantum entities in a first target and a second plurality of quantum entities in a second target , a first non-local effect of said second target on said first target through said plurality of quantum entanglements and/or a second non-local effect of said first target on said second target through said plurality of quantum entanglements which comprises the steps of:selecting said first target which comprises a first chemical substance, water-based medium, human or animal;selecting said second target which comprises a second chemical substance, water-based medium, human or animal;providing a photon or magnetic pulse generating source which emits a plurality of photons or magnetic ...

Method and apparatus for producing and detecting non-local effects of substances

A method and apparatus are disclosed which produce and detect quantum entanglement and non-local effects of substances on responsive targets such as biological systems. In one embodiment, the method includes the steps of providing two parts of a quantum-entangled medium, applying one part to a biological system such as a human, contacting the other part with a desired substance such as a medication or substance encoded with a message, and detecting change of a biological parameter with a detecting device, whereby a non-local effect of the substance on the said biological system is produced and detected for a beneficial purpose. Also described are a number of implementations. 1. A method of producing and detecting a second plurality of quantum entanglements between a third plurality of quantum entities in a first target and a fourth plurality of quantum entities in a second target , a first non-local effect of said second target on said first target through said second plurality of quantum entanglements and/or a second non-local effect of said first target on said second target through said second plurality of quantum entanglements which comprises the steps of:selecting said first target which comprises a first chemical substance, human or animal at a first location;selecting said second target which comprises a second chemical substance, human or animal at a second location;providing a first water-based medium at said first location and a second water-based medium at said second location, a first plurality of quantum entities in said first medium being in a first plurality of quantum entanglements with a second plurality of quantum entities in said second medium;providing a detecting means for detecting said second plurality of quantum entanglements, said first non-local effect and/or said second non-local effect when said detecting means operates;causing said first target to interact with said first water-based medium through a first contact or radiation from a ...

NON-ADIABATIC IMPLEMENTATION OF AN ISWAP QUANTUM LOGIC GATE

Methods, systems and apparatus for generating plunge schedules for implementing iSWAP quantum logic gates between a first qubit and a second qubit. In one aspect, a plunge schedule that defines a trajectory of a detuning between a frequency of the first qubit and a frequency of the second qubit includes, during a first stage, non-adiabatically driving detuning between the frequency of the first qubit and the frequency of the second qubit through a first avoided crossing in a leakage channel, during a second stage, driving detuning between the frequency of the first qubit and the frequency of the second qubit through a second avoided crossing in a swap channel. during a third stage, allowing the first qubit and the second qubit to freely evolve and interact, during a fourth stage, implementing the second stage in reverse order, and during a fifth stage, implementing the first stage in reverse order. 1. A method for implementing an i SWAP quantum logic gate between a first qubit and a second qubit , the method comprising: during a first stage, non-adiabatically driving detuning between the frequency of the first qubit and the frequency of the second qubit through a first avoided crossing in a leakage channel;', 'during a second stage, driving detuning between the frequency of the first qubit and the frequency of the second qubit through a second avoided crossing in a swap channel;', 'during a third stage, allowing the first qubit and the second qubit to freely evolve and interact;', 'during a fourth stage, implementing the second stage in reverse order; and', 'during a fifth stage, implementing the first stage in reverse order., 'implementing a plunge schedule that defines a trajectory of a detuning between a frequency of the first qubit and a frequency of the second qubit, comprising2. The method of claim 1 , wherein the plunge schedule is based on a trapezoidal ramp function characterized by a ramp-up time claim 1 , hold time and the variance of a Gaussian filter ...

AUTOMATICALLY LINKING TEXT TO CONCEPTS IN A KNOWLEDGE BASE

According to an aspect, automatically linking text to concepts in a knowledge base using differential analysis includes receiving a text string and selecting, based on contents of the text string, a plurality of data sources that correspond to concepts in the knowledge base. In a further aspect, automatically linking the text to the concepts includes calculating, for each of the selected data sources, a probability that the text string is output by a language model built using the selected data source, calculating a probability that the text string is output by a generic language model, calculating link confidence scores for each concept based on a differential analysis of the probabilities, and creating a link from the text string to one of the concepts in the knowledge base. The creating is based on a link confidence score of the concept being more than a threshold value away from a prescribed threshold. 1. A method for automatically linking text to concepts in a knowledge base using a differential analysis , the method comprising:receiving a text string;selecting a plurality of data sources that correspond to concepts in the knowledge base, the selecting based on contents of the text string;calculating, for each of the selected data sources, a probability that the text string is output by a language model built using the selected data source;calculating a probability that the text string is output by a generic language model;calculating link confidence scores for each concept based on a differential analysis of the probabilities; andcreating a link from the text string to one of the concepts in the knowledge base, the creating based on a link confidence score of the concept being more than a threshold value away from a prescribed threshold.2. The method of claim 1 , wherein the differential analysis compares the probability that the text string is output by a language model built using a data source to the probability that the text string is output by a generic ...

Quantum-based machine learning for oncology treatment

A method and system may utilize a quantum information state analog to reinforcement learning techniques to determine whether to adapt a course of treatment for an oncology patient. A quantum-based reinforcement learning engine may represent a decision to adapt and a decision not to adapt the course of treatment for the oncology patient as quantum information states in a superposition. Each quantum information state has a corresponding amplitude indicative of the likelihood that the quantum information state has a higher expected clinical outcome for the oncology patient. Using a quantum search algorithm, the quantum-based reinforcement learning engine identifies amplitudes for each quantum information state in the superposition. The quantum-based reinforcement learning engine instructs a health care provider to adapt the course of treatment for the oncology patient when a likelihood corresponding to the decision to adapt state exceeds a likelihood threshold.

QUANTUM VARIATIONAL METHOD, APPARATUS, AND STORAGE MEDIUM FOR SIMULATING QUANTUM SYSTEMS

The present disclosure discloses a method for obtaining optimal variational parameters of a ground state wavefunction for a Hamiltonian system. The method includes initializing a plurality of variational parameters and sending the variational parameters to a quantum computing portion to output a plurality of measurement results. The method includes transmitting the measurement results to a classical computing portion to update the plurality of variational parameters based on the plurality of measurement results and an update rule, and determining whether a measured energy satisfies a convergence rule. When the measured energy does not satisfy the convergence rule, the method includes sending the plurality of updated variational parameters to the quantum computing portion for a next iteration; and when the measured energy satisfies the convergence rule, the method includes obtaining a plurality of optimal variational parameters for the Hamiltonian system. 1. A method for obtaining a plurality of optimal variational parameters of a wavefunction for a Hamiltonian system , the method comprising:initializing, by a device comprising a quantum computing portion and a classical computing portion in communication with the quantum computing portion, a plurality of variational parameters of a wavefunction for a Hamiltonian system;sending, by the device, the plurality of variational parameters to the quantum computing portion to begin an iteration, so that the quantum computing portion performs a plurality of measurements to output a plurality of measurement results based on the plurality of variational parameters, the wavefunction, and the Hamiltonian system;transmitting, by the device, the plurality of measurement results from the quantum computing portion to the classical computing portion, so that the classical computing portion updates the plurality of variational parameters based on the plurality of measurement results and an update rule;determining, by the device, ...

MEASUREMENT SEQUENCE DETERMINATION FOR QUANTUM COMPUTING DEVICE

A computing system is provided, including a processor configured to identify a plurality of measurement sequences that implement a logic gate. Each measurement sequence may include a plurality of measurements of a quantum state of a topological quantum computing device. The processor may be further configured to determine a respective estimated total resource cost of each measurement sequence of the plurality of measurement sequences. The processor may be further configured to determine a first measurement sequence that has a lowest estimated total resource cost of the plurality of measurement sequences. The topological quantum computing device may be configured to implement the logic gate by applying the first measurement sequence to the quantum state. 1. A computing system comprising: identify a plurality of measurement sequences that implement a logic gate, each measurement sequence including a plurality of measurements of a quantum state of a topological quantum computing device;', 'determine a respective estimated total resource cost of each measurement sequence of the plurality of measurement sequences; and', 'determine a first measurement sequence that has a lowest estimated total resource cost of the plurality of measurement sequences,, 'a processor configured towherein the topological quantum computing device is configured to implement the logic gate by applying the first measurement sequence to the quantum state.2. The computing system of claim 1 , wherein claim 1 , for each measurement sequence of the plurality of measurement sequences claim 1 , the processor is configured to determine the respective estimated total resource cost at least in part by:determining an estimated weighted resource cost of each measurement included in the measurement sequence; anddetermining the estimated total resource cost of the measurement sequence based on the plurality of estimated weighted resource costs.3. The computing system of claim 2 , wherein the estimated weighted ...

METHOD OF SIMULATING QUANTUM COMPUTING SYSTEM AND QUANTUM COMPUTING SIMULATION SYSTEM

Provided is a method of simulating a quantum computing system having an error correction function. The method includes generating a quantum information density matrix, generating a coded density matrix by performing quantum error correction coding on the quantum information density matrix, applying quantum computing to the coded density matrix and calculating a change in a first reliability of the coded density matrix, applying the quantum computing to the quantum information density matrix and calculating a change in a second reliability of the quantum information density matrix, and determining an operation time of the quantum computing, based on the change in the first reliability and the change in the second reliability. 1. A method of simulating a quantum computing system having an error correction function , the method comprising:generating a quantum information density matrix;generating a coded density matrix by performing quantum error correction coding on the quantum information density matrix;applying quantum computing to the coded density matrix and calculating a change in a first reliability of the coded density matrix;applying the quantum computing to the quantum information density matrix and calculating a change in a second reliability of the quantum information density matrix; anddetermining an operation time of the quantum computing, based on the change in the first reliability and the change in the second reliability.2. The method of claim 1 , wherein the calculating of the change in the first reliability includes:calculating the change in the first reliability of the coded density matrix in units of a unit time.3. The method of claim 2 , wherein the quantum computing includes the operation of two or more quantum gates claim 2 , andwherein the unit time is less than a respective operation time of the quantum gates.4. The method of claim 2 , wherein the calculating of the change in the first reliability of the coded density matrix in units of the ...

A METHOD OF OPTIMAL SCHEDULING AND REAL-TIME CONTROL FOR AN xMANAGEMENT SYSTEM

One of the features of the invented method is that it adds to the scenario selection criteria the impact on the control command of the single scenarios. If necessary it takes also into account the performance achieved during single scenario optimization and combines scenario describing space information with single scenario optimization results space information. By using reduced scenarios (subset) an overall optimization procedure based on the subset can be established. If results are not satisfactory from the performance or constraints point of view a new iteration is initiated. 1. A method of a scenario based optimization , comprising:a scenario generation step that generates single scenarios which are described by time sequence of quantities influencing a system and by time sequence of constraints for the system;a single optimization step that carries out optimization of each single scenarios; andan overall optimization step that carries out optimization of an overall scenario using a reduced scenario set which contains scenario subsets that are selected from all single scenarios based on the results of the single optimization step with/without considering the properties of the scenarios itself.2. The method according to claim 1 , wherein the overall optimization step includes a scenario reduction step for selecting the scenario subsets based on the impact in command sequences of the single scenarios.3. The method according to claim 2 , wherein the scenario reduction step takes into consideration the performance results of the single scenarios obtained by the single optimization step.4. The method according to claim 2 , wherein the scenario reduction step finds a set of the most extreme scenarios by using metrics.5. The method according to claim 2 , wherein the scenario reduction step finds a set of cluster centers by clustering the command sequences according to problem-specific or general rules.6. The method according to further comprising:an iteration step ...

METHOD AND APPARATUS FOR PERFORMING MACHINE LEARNING BASED ON CORRELATION BETWEEN VARIABLES

An apparatus and a method for performing machine learning by executing steps of: generating a decision tree-based machine learning model based on training data; selecting two variables from a decision tree of the machine learning model and determining a correlation between two selected variables; and performing the machine learning based on determined correlation are provided. 1. An apparatus for performing machine learning by determining a correlation between variables , the apparatus comprising:a processor and a memory, wherein the processor executes a program stored in the memory to perform:generating a decision tree-based machine learning model based on training data;selecting two variables from a decision tree of the machine learning model and determining a correlation between two selected variables; andperforming the machine learning based on determined correlation.2. The apparatus of claim 1 ,wherein when the processor performs the determining of the correlation between two selected variables, the processor performs:measuring a difference between results of an objective function to which the two variables are inputs; anddetermining that the correlation between the two variables is a positive correlation when the difference between the results is smaller than a predetermined first threshold.3. The apparatus of claim 2 ,wherein when the processor performs the measuring of the difference between results of the objective function, the processor performs:measuring a difference between a first result value output from the objective function to which a pair consisting of the two variables is input and a second result value output from the objective function to which a converted pair for the pair is input, wherein an order of the two variables in the pair is switched within the converted pair.4. The apparatus for claim 2 ,wherein when the processor performs the determining of the correlation between two selected variables, the processor further performs:changing ...

LEARNING APPARATUS, LEARNING METHOD, AND COMPUTER-READABLE RECORDING MEDIUM

Provided is a learning apparatus including a feature amount generation unit configured to generate a feature amount based on learning data, a division condition generation unit configured to generate a division condition in accordance with the feature amount and a complexity requirement that indicates the number of feature amounts, a learning data division unit configured to divide the learning data into groups based on the division condition, a learning data evaluation unit configured to evaluate a significance of each division condition by using a pre-division group and a post-division group; and a node generation unit configured to, if there is a significance in the division condition of the pre-division and post-division groups, generate a node of a decision tree relating to the division condition. 1. A learning apparatus comprising:a feature amount generation unit configured to generate a feature amount based on learning data;a division condition generation unit configured to generate a division condition in accordance with the feature amount and a complexity requirement that indicates the number of feature amounts;a learning data division unit configured to divide the learning data into groups based on the division condition;a learning data evaluation unit configured to evaluate a significance of each division condition by using a pre-division group and a post-division group; anda node generation unit configured to, if there is a significance in the division condition of the pre-division and post-division groups, generate a node of a decision tree relating to the division condition.2. The learning apparatus according to claim 1 , further comprising:a division condition addition unit configured to, if there is no significance in all the division conditions in the pre-division and post-division groups, increase the number of feature amounts indicated by the complexity requirement, and cause the division condition generation unit to add the division conditions.3. ...

ADAPTIVE COMPILATION OF QUANTUM COMPUTING JOBS

Systems, computer-implemented methods, and computer program products to facilitate adaptive compilation of quantum computing jobs 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 selection component that selects a quantum device to execute a quantum program based on one or more run criteria. The computer executable components can further comprise an adaptive compilation component that modifies the quantum program based on one or more attributes of the quantum device to generate a modified quantum program compilation of the quantum program. 1. A system , comprising:a memory that stores computer executable components; and a selection component that selects a quantum device to execute a quantum program based on one or more run criteria; and', 'an adaptive compilation component that modifies the quantum program based on one or more attributes of the quantum device to generate a modified quantum program compilation of the quantum program., 'a processor that executes the computer executable components stored in the memory, wherein the computer executable components comprise2. The system of claim 1 , wherein the adaptive compilation component further dispatches the modified quantum program compilation to a queue of the quantum device to execute the modified quantum program compilation claim 1 , thereby facilitating at least one of reduced turnaround time to execute the quantum program or reduced latency of the quantum device.3. The system of claim 1 , wherein the adaptive compilation component further dispatches the modified quantum program compilation to a queue of the quantum device to execute the modified quantum program compilation based on a run order position of the modified quantum program compilation in the queue of the quantum device.4. The system of claim 1 , ...

TRANSMON QUBIT FLIP-CHIP STRUCTURES FOR QUANTUM COMPUTING DEVICES

A quantum computing device is formed using a first chip and a second chip, the first chip having a first substrate, a first set of pads, and a set of Josephson junctions disposed on the first substrate. The second chip has a second substrate, a second set of pads disposed on the second substrate opposite the first set of pads, and a second layer formed on a subset of the second set of pads. The second layer is configured to bond the first chip and the second chip. The subset of the second set of pads corresponds to a subset of the set of Josephson junctions selected to avoid frequency collision between qubits in a set of qubits. A qubit is formed using a Josephson junction from the subset of Josephson junctions and another Josephson junction not in the subset being rendered unusable for forming qubits. 1. A quantum computing device comprising:a first chip having a set of Josephson junctions; anda second chip having a set of pads, wherein the second chip is configured to bond with the first chip,wherein an unused pad of the second chip corresponds to a disabled Josephson junction of the first chip, wherein the disabled Josephson junction is selected to avoid a frequency collision between a disabled qubit resulting from the disabled Josephson junction and qubits in a set of qubits, a qubit in the set of qubits resulting from a Josephson junction in a subset of Josephson junctions corresponding to a subset of pads.2. The quantum computing device of claim 1 , further comprising:an unusable Josephson junction in the set of Josephson junctions, wherein a first Josephson junction in the set of Josephson junctions is modified to become the unusable Josephson junction responsive to the first Josephson junction being excluded from the subset of the set of Josephson junctions.3. The quantum computing device of claim 2 , further comprising:a disconnected pad in a first set of pads on the first chip, wherein the first set of pads comprises a first pad electrically coupled to the ...

METHOD AND SYSTEM FOR VERIFYING STATE MONITOR RELIABILITY IN HYPER-CONVERGED INFRASTRUCTURE APPLIANCES

A method and system for verifying state monitor reliability in hyper-converged infrastructure (HCI) appliances. Specifically, the method and system disclosed herein entail using a supervised machine learning model—i.e., a classification decision tree—to accurately distinguish whether conflicting event notifications, logged across multiple state monitors tracking state on an HCI appliance, are directed to a real event or a non-real event. The classification decision tree, generated based at least on information gains calculated for the multiple state monitors, may reflect which state monitor(s) is/are more reliable in accurately classifying the conflicting event notifications. 1. A method for reliably classifying event notifications , comprising:obtaining a first local event log from a first state monitor and a second local event log from a second state monitor;merging the first local event log and the second local event log to generate a first global event log comprising a first event notification;deriving, from the first global event log, a first set of event log inputs comprising a first classifier input tuple associated with the first event notification;determining, for the first event notification, a first event classification using the first classifier input tuple and an optimized event classifier; andperforming a first action based at least on the first event classification.2. The method of claim 1 , wherein the first classifier input tuple comprises a first label representing a first acknowledgement of the first event notification given by the first state monitor and a second label representing a second acknowledgement of the first event notification given by the second state monitor.3. The method of claim 2 , wherein the first acknowledgement and the second acknowledgement each classify the first event notification as being directed to one selected from a group consisting of a real event claim 2 , a non-real event claim 2 , and an undefined event.4. The ...

INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM

An information processing apparatus of the present invention is configured to include a model generation means for, based on data including a plurality of attributes, generating a model using the attributes, and an attribute change means for changing the attributes used for generating the model, based on the generated model. The model generation means is configured to generate a new model, based on data including the changed attributes. 1. An information processing apparatus comprising:a memory storing instructions; andat least one processor configured to execute the instructions, the instructions comprising:based on data including a plurality of attributes, generating a model using the attributes; andchanging the attributes used for generating the model, based on the generated model; andfurther generating a new model, based on data including the changed attributes.2. The information processing apparatus according to claim 1 , whereinthe instructions further comprise:eliminating at least one attribute of the attributes used in the model, based on the generated model, andgenerating a new model, based on data including another attribute that is different from the eliminated attribute.3. The information processing apparatus according to claim 1 , whereinthe instructions further comprise determining an attribute to be eliminated based on used states of the attributes in the generated model, and eliminating the attribute.4. The information processing apparatus according to claim 3 , whereinthe instructions further comprise calculating an effecting degree of each of the attributes according to a criterion preset to the model based on the used states of the attributes in the generated model, and eliminating the attribute having a high effecting degree.5. The information processing apparatus according to claim 3 , whereinthe instructions further comprise:performing generation of the model a plurality of times based on data including same attributes, anddetermining the ...

Interconnect structures for assembly of semiconductor structures including superconducting integrated circuits

A multi-layer semiconductor structure includes a first semiconductor structure and a second semiconductor structure, with at least one of the first and second semiconductor structures provided as a superconducting semiconductor structure. The multi-layer semiconductor structure also includes one or more interconnect structures. Each of the interconnect structures is disposed between the first and second semiconductor structures and coupled to respective ones of interconnect pads provided on the first and second semiconductor structures. Additionally, each of the interconnect structures includes a plurality of interconnect sections. At least one of the interconnect sections includes at least one superconducting and/or a partially superconducting material.

SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR QUERY CLARIFICATION

A system, method and computer program product for query clarification are described. Data from a corpus is automatically labelled using a trained classifier. The labels are assigned to indicator variables that each relate to the context of each data. During query, a decision tree is generated from the search results in such a way as to maximize information gain obtainable from a question:answer pair that can be posed to the user. The search results can be narrowed by obtaining the answer and correspondingly pruning the decision tree. 1. A system for query clarification applied to a set of search results generated by a search query performed on a corpus of data , the system comprising one or more processors configured to execute:a labelling engine to apply to each datum within the corpus a label corresponding to each one of a plurality of predetermined indicator variables, each indicator variable relating to context of the respective data; and generate a decision tree using the set of search results, the decision tree comprising nodes corresponding to the indicator variables and edges corresponding to the labels, the decision tree generated to maximize information gain based on pruning the decision tree in response to obtaining a desired label for a selected indicator variable; and', 'prune the decision tree in response to a question posed to a user to obtain a label for an indicator variable., 'a clarification engine to2. The system of claim 1 , wherein each indicator variable corresponds to a question and each label of associated edges corresponds to an answer associated with the question.3. The system of claim 1 , wherein each indicator variable represents a category of interest to a particular field represented by the corpus of data.4. The system of claim 1 , wherein at least one of the labels is unknown.5. The system of claim 1 , wherein each datum in the corpus comprises one or more webpages.6. The system of claim 5 , wherein at least a portion of the data are ...

Providing controlled pulses for quantum computing

A quantum mechanical radio frequency (RF) signaling system includes a transmission line that receives and conducts an RF pulse signal operating at a radio frequency, a first qubit having a quantum mechanical state that is a linear combination of at least two quantum mechanical eigenstates, and a first network of reactive electrical components having an input that is coupled to the transmission line for receiving the RF pulse signal and an output that is coupled to the first qubit. The first network of reactive electrical components attenuates the amplitude of the RF pulse signal and produces a first attenuated RF pulse signal that is applied to the first qubit. The first attenuated RF pulse signal operates at the radio frequency and has a first attenuated amplitude that causes a predefined change in the linear combination of at least two quantum mechanical eigenstates within the first qubit.

INTEGRATING CIRCUIT ELEMENTS IN A STACKED QUANTUM COMPUTING DEVICE

A stacked quantum computing device including a first chip that includes a first dielectric substrate and a superconducting qubit on the first dielectric substrate, and a second chip that is bonded to the first chip and includes a second dielectric substrate, a qubit readout element on the second dielectric substrate, a control wire on the second dielectric substrate, a dielectric layer covering the control wire, and a shielding layer covering the dielectric layer. 1. A device comprising: a first dielectric substrate and', 'a superconducting qubit on the first dielectric substrate;, 'a first chip comprising'} a second dielectric substrate,', 'a qubit readout element on the second dielectric substrate,', 'a control wire on the second dielectric substrate,', 'a dielectric layer covering the control wire, and', 'a shielding layer covering the dielectric layer,, 'a second chip bonded to the first chip, the second chip comprising'}wherein the shielding layer is arranged to reduce crosstalk between the control wire on the second chip and the superconducting qubit on the first chip by isolating electromagnetic fields from the control wire and from the superconducting qubit from interfering with one another.2. The device of claim 1 , wherein the dielectric layer comprises an opening through which the qubit readout element is exposed.3. The device of claim 1 , wherein the dielectric layer comprises a dielectric material having a loss tangent greater than about 10at a frequency between about 1 GHz and about 10 GHz.4. The device of claim 1 , wherein the superconducting qubit comprises a readout region claim 1 , andwherein the qubit readout element overlaps the readout region of the qubit.5. The device of claim 4 , wherein the qubit readout element comprises a resonator element electrically coupled to a pad element claim 4 , and wherein the pad element overlaps the readout region of the qubit without the resonator element overlapping the readout region of the qubit.6. The device ...

Dynamic and locally-faithful explanation of machine learning models for precision medicine

A method of explaining a machine learning model, including: receiving a plurality of disease states for a patient over time from a database, wherein the disease states have a plurality of features; generating a plurality of locally faithful explanation models for the patient for each disease state based upon the machine learning model; calculating an explanation with respect to one feature of the plurality of features over time using the locally faithful explanation models; and calculating the importance of the one feature of the plurality of features over time based upon the plurality of locally faithful explanation models .

OPTICAL ALIGNMENT USING REFLECTIVE DOVE PRISMS

Aspects of the present disclosure describe techniques for optical alignment using a reflective dove prism. For example, a system for optical alignment is described that includes an assembly having a housing with three separate, reflecting structures positioned to produce three reflections of one or more laser beams or one or more images, and a controller configured to control a rotation of the assembly about a pivot point to produce a tilt in orientation of the one or more lasers beams or the one or more images that is twice an angle of rotation of the assembly. Another system and a method for aligning laser beams using a housing with three separate, reflecting structures in a trapped ion quantum information processing (QIP) system are also described. 1. A system for optical alignment , comprising:an assembly having a housing with three separate, reflecting structures positioned to produce three reflections of one or more laser beams or one or more images; anda controller configured to control a rotation of the assembly about a pivot point to produce a tilt of the one or more lasers beams or the one or more images that is twice an angle of rotation of the assembly.2. The system of claim 1 , wherein the reflecting structures are separate mirrors positioned at different locations of the housing.3. The system of claim 1 , wherein:the one or more laser beams include at least one ultraviolet (UV) laser beam, andeach of the three reflecting structures is configured to reflect the UV laser beam without absorption of the UV laser beam.4. The system of claim 1 , wherein the reflecting structures are positioned along a direction of propagation of the one or more laser beams.5. The system of claim 1 , wherein a first reflecting structure and a third reflecting structure of the reflecting structures are angled with respect to a propagation axis of the one or more laser beams.6. The system of claim 5 , wherein the first reflecting structure and the third reflecting structure are ...

MITIGATION OF CHARGING ON OPTICAL WINDOWS

Aspects of the present disclosure describe techniques for mitigating charging on optical windows. For example, a device for mitigating charges inside a chamber of a trapped ion system is described that includes an array of parallel wires formed from a single, conductive plate by cutting elongated gaps through an entire thickness of the conductive plate that separate the wires, an outer portion of the conductive plate to which the wires are attached is configured to position the wires to run parallel to one or more trapped ions in the chamber and to position the wires between a dielectric component of the chamber and the one or more trapped ions. A chamber with such an array of parallel wires and a method of using such an array of parallel wires are also described. 1. A device for mitigating charges inside a chamber of a trapped ion system , comprising:an array of parallel wires formed from a single, conductive plate by cutting elongated gaps through an entire thickness of the conductive plate that separate the wires, an outer portion of the conductive plate to which the wires are attached is configured to position the wires to run parallel to one or more trapped ions in the chamber and to position the wires between a dielectric component of the chamber and the one or more trapped ions.2. The device of claim 1 , wherein a width of each of the wires is the same and a width of each of the elongated gaps between the wires is the same.3. The device of claim 1 , wherein the conductive plate is a square plate.4. The device of claim 1 , wherein the conductive plate is a metal plate.5. The device of claim 1 , wherein the conductive plate is approximately 20 millimeters by 20 millimeters.6. The device of claim 1 , wherein a width of each of the wires is approximately 50 microns.7. The device of claim 1 , wherein a width of each of the elongated gaps is approximately 460 microns.8. The device of claim 1 , wherein a number of the wires is approximately 20 wires.9. The device of ...

Monitoring of Neural-Network-Based Driving Functions

The invention relates to a control system for controlling a brake, a steering and/or a drive of an autonomous or automated vehicle. This involves an artificial-intelligence-based first control apparatus being monitored by virtue of a criticality of a driving situation being determined on the basis of simple calculation values, wherein a specific criticality of the driving situation, or an inappropriate reaction by the first control apparatus to the driving situation, can result in changeover to a second control apparatus that undertakes the control of the vehicle on the basis of a deterministic calculation rule.

SYSTEMS AND METHODS FOR SUPERCONDUCTING DEVICES USED IN SUPERCONDUCTING CIRCUITS AND SCALABLE COMPUTING

Approaches useful to operation of scalable processors with ever larger numbers of logic devices (e.g., qubits) advantageously take advantage of QFPs, for example to implement shift registers, multiplexers (i.e., MUXs), de-multiplexers (i.e., DEMUXs), and permanent magnetic memories (i.e., PMMs), and the like, and/or employ XY or XYZ addressing schemes, and/or employ control lines that extend in a “braided” pattern across an array of devices. Many of these described approaches are particularly suited for implementing input to and/or output from such processors. Superconducting quantum processors comprising superconducting digital-analog converters (DACs) are provided. The DACs may use kinetic inductance to store energy via thin-film superconducting materials and/or series of Josephson junctions, and may use single-loop or multi-loop designs. Particular constructions of energy storage elements are disclosed, including meandering structures. Galvanic connections between DACs and/or with target devices are disclosed, as well as inductive connections. 1. A system , comprising:a first set of digital-to-analog converters (DACs), each of the DACs of the first set of DACs including a respective loop of material and a respective pair of Josephson junctions that interrupt the respective loop of material and are electrically coupled in parallel with one another in the respective loop of material;a first quantum flux parametron (QFP) based shift register comprising a sequence of a plurality of QFP-based shift register elements, the first QFP-based shift register one of magnetically or galvanically coupleable to the DACs of the first set of DACs;a power line that serially couples the DACs of the first set of DACs; and 'each of the DACs of the first set of DACs is independently addressable by a triplet of three signals a successive number of times to store a variable number of flux quanta, the triplet of three signals including a first signal received via the QFP-based shift ...

WEARABLE DEVICE-BASED IDENTITY AUTHENTICATION METHOD AND SYSTEM

A wearable device-based identity authentication method and system, comprising: a user terminal initiates an authentication request to a target server and provides device information of the user terminal, the target server generates a temporary session, and sends a temporary session ID and the device information to a quantum key distribution network; the quantum key distribution network generates identification information, searches a wearable device bound to the user terminal, and sends the identification information to the wearable device; the wearable device receives and provides the identification information to the user terminal, the user terminal acquires the identification information, and sends verification information to the wearable device and then to the quantum key distribution network; the quantum key distribution network generates an authentication result and sends to the target server; and the target server generates an identification authentication result and sends to the user terminal. 1. An identity authentication method based on a wearable device , comprising the steps of:{'b': '1', 'S: initiating an authentication request and providing device information of a user terminal, by the user terminal, to a target server; and receiving, by the target server, the authentication request to generate a temporary session, and transmitting, by the target server, a temporary session ID and the device information to a quantum key distribution network;'}{'b': '2', 'S: receiving, by the quantum key distribution network, the temporary session ID and the device information to generate identification information, searching for, by the quantum key distribution network, a wearable device bound to the user terminal, and transmitting, by the quantum key distribution network, the identification information to the wearable device;'}{'b': '3', 'S: receiving, by the wearable device, the identification information, and providing, by the wearable device, the identification ...

QUANTUM KEY DISTRIBUTION SYSTEM AND METHOD

A continuous variable quantum key distribution system comprises a transmitter and a receiver. The first quantum signal has a first polarization and is associated with first quadrature components and the second quantum signal has a second polarization and is associated with second quadrature components. The receiver receives the quantum signals transmitted by the transmitter via a quantum communication channel; estimates a channel matrix representing the polarization rotation of the first and second polarization caused by the quantum communication channel; modifies the received first and second quantum signals on the basis of the polarization rotation; and uses the modified received first and second quantum signals for generating a secret key. The transmitter may modify the transmitted first quantum signal and the transmitted second quantum signal based on the polarization rotation and use the modified transmitted first quantum signal and the modified transmitted second quantum signal for generating a secret key. 1. A continuous variable quantum key distribution system , comprising:{'sub': H', 'H', 'v', 'v, 'a transmitter configured to modulate and to transmit a plurality of quantum signals, including a first quantum signal and a second quantum signal, wherein the first quantum signal has a first polarization and is associated with first quadrature components Xand Pand the second quantum signal has a second polarization and is associated with second quadrature components Xand P; and'} wherein the receiver is configured to modify the received first quantum signal and the received second quantum signal on the basis of the polarization rotation and to use the modified received first quantum signal and the modified received second quantum signal for generating a secret key, and/or', 'wherein the transmitter is configured to modify the transmitted first quantum signal and the transmitted second quantum signal on the basis of the polarization rotation and to use the ...

METHODS AND STRUCTURE TO PROBE THE METAL-METAL INTERFACE FOR SUPERCONDUCTING CIRCUITS

A method of measuring contact resistance at an interface for superconducting circuits is provided. The method includes using a chain structure of superconductors to measure a contact resistance at a contact between contacting superconductor. The method further includes eliminating ohmic resistance from wire lengths in the chain structure by operating below the lowest superconducting transition temperature of all the superconductors in the chain structure. The measurement is dominated by contact resistances of the contacts between contacting superconductors in the chain. 1. A method of measuring contact resistance at an interface for electronic circuits comprising:providing a chain structure of conducting elements, the conducting elements arranged in series to contact adjacent conducting elements at respective contacts having respective contact resistances;measuring a serial resistance of the chain structure at cryogenic temperatures; anddetermining a contact resistance based on the measured serial resistance.2. A method of measuring contact resistance at an interface for superconducting circuits comprising:using a chain structure of superconductors to measure a contact resistance at a contact between contacting superconductors;eliminating ohmic resistance from wire lengths in the chain structure by operating below the lowest superconducting transition temperature of all the superconductors in the chain structure,wherein the measurement is dominated by contact resistances of the contacts between contacting superconductors in the chain.3. The method of claim 2 , wherein the superconductors of the chain structure of superconductors are made of a first superconducting material and a second superconducting material different from the first superconducting material.4. The method of claim 3 , wherein the superconductors of the chain structure of superconductors are alternately arranged between superconductors of the first superconducting material and superconductors of the ...

SHARING OF COMPUTE RESOURCES BETWEEN THE VIRTUALIZED RADIO ACCESS NETWORK (VRAN) AND OTHER WORKLOADS

The present disclosure relates to systems and methods for sharing compute resources. The systems and methods may include identifying a plurality of workloads to complete by a deadline. The systems and methods may include generating a performance prediction for each workload of the plurality of workloads. The systems and methods may use the performance prediction to calculate a number of compute resources required for the plurality of workloads to complete by the deadline. The systems and methods may schedule the plurality of workloads across the number of compute resources. 1. A method , comprising:identifying a plurality of virtualized Radio Access Networks (vRAN) workloads and a plurality of other workloads;generating a performance prediction for each workload of the plurality of vRAN workloads that indicates a prediction for how long each workload of the plurality of vRAN workloads will take to complete;calculating based on the performance prediction a number of compute resources required for the plurality of vRAN workloads to use to complete by a deadline;scheduling the plurality of vRAN workloads across the number of compute resources required;determining a remaining number of available compute resources; andscheduling the plurality of other workloads across the remaining number of available compute resources.2. The method of claim 1 , wherein the plurality of vRAN workloads include one or more signal processing tasks for a base station or data link layer (L2) tasks.3. The method of claim 2 , wherein the deadline is a transmission deadline for transmission of the one or more signal processing tasks with the base station or reception of the one or more signal processing tasks with the base station.4. The method of claim 2 , wherein the performance prediction is generated by:using a machine learning model to generate a plurality of quantile decision trees, where each quantile decision tree is associated with an individual signal processing task; andidentifying a ...

SYNTHESIS OF A QUANTUM CIRCUIT

Systems, computer-implemented methods, and computer program products to facilitate synthesis of a quantum circuit 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 circuit generation component that generates, iteratively, quantum circuits from 1 to N two-qubit gates, wherein at least one or more iterations (1, 2, . . . , N) adds a single two-qubit gate to circuits from a previous iteration based on using added single 2-qubit gates that represent operations distinct from previous operations relative to previous iterations. The computer executable components can further comprise a circuit identification component that identifies, from the quantum circuits, a desired circuit that matches a quantum circuit representation. 1. A system , comprising:a memory that stores computer executable components; and a circuit generation component that generates, during a first iteration, a first set of quantum circuits comprising 2-qubit gates;', 'a second circuit generation component that generates, during a second iteration, a second set of quantum circuits by adding a 2-qubit gate to the first set of quantum circuits such that the second set of quantum circuits are selected to a redundant operation use the 2-qubit gate without introducing the redundant operation to that of the first set of quantum circuits; and', 'a circuit identification component that identifies, from the first set of quantum circuits and the second set of quantum circuits, a desired circuit that matches a quantum circuit representation., 'a processor that executes the computer executable components stored in the memory, wherein the computer executable components comprise2. The system of claim 1 , wherein the first set of quantum circuits and the second set of quantum circuits comprise Clifford quantum circuits ...

OBTAINING SUPPORTED DECISION TREES FROM TEXT FOR MEDICAL HEALTH APPLICATIONS

Systems, devices, and methods discussed herein provide improved decision trees (e.g., supported decision trees). A supported decision tree can be generated by generating discourse trees from various documents associated with a subject. One or more decision chains can be generated from each discourse tree, each decision chain being a sequence of elements comprising a premise and a decision connected by rhetorical relationships. A supported decision tree can be generated from the various decision chains, where the nodes of the decision tree are identified from the elements of the plurality of decision chains and ordered based on a set of predefined priority rules. Subsequent input data can be received and the supported decision tree can be traversed to classify the input data. 1. A method for classifying input data using a supported decision tree , comprising:accessing a corpus of documents associated with a subject;generating a first discourse tree from a first document and a second discourse tree from a second document, each discourse tree including a plurality of nodes, each nonterminal node representing a rhetorical relationship between at least two fragments of a corresponding document, and each terminal node of the nodes of the discourse tree being associated with one of the fragments, the first and second documents from the corpus of documents;generating, by the one or more processors, a first plurality of decision chains from the first discourse tree and a second plurality of decision chains from the second discourse tree, each decision chain being a sequence of elements comprising a premise and a decision connected by rhetorical relationships, the elements being identified from the plurality of nodes of the discourse trees;generating, by the one or more processors, the supported decision tree based at least in part on the first and second plurality of decision chains, the supported decision tree having nodes that correspond to a feature of a decision and ...

RULES AND MACHINE LEARNING TO PROVIDE REGULATORY COMPLIED FRAUD DETECTION SYSTEMS

An approach is provided that receives data sets pertaining to entities. The received data sets are analyzed using a trained artificial intelligence (AI) system, with the analysis results in a fraud probability level. In response to the probability level indicating a high probability of fraud, a rule-based decision tree is applied to the received set of data. A behavior pattern is identified based on a result of the rule-based decision tree and this behavior pattern is used to identify a possible fraudulent event pertaining one of the entities. 1. A method implemented by an information handling system that includes a processor and a memory accessible by the processor , the method comprising:receiving one or more sets of data pertaining to a plurality of entities;analyzing the received sets of data using a trained artificial intelligence (AI) system, wherein the analysis results in a fraud probability level;applying a rule-based decision tree to the received set of data based on the resulting fraud probability level;identifying a pattern based on a result of the rule-based decision tree; anddetecting a possible fraudulent event pertaining to a behavior pattern corresponding to a selected one of the plurality of entities.2. The method of wherein the fraud probability level corresponds to a confidence score in response to the AI system's analysis of a plurality of behavior patterns included in the sets of data.3. The method of further comprising:applying the rule-based decision tree in response to the confidence score reaching a predetermined threshold.4. The method of further comprisingforming the behavior pattern from a plurality of logic branches included in the sets of data that reach a result.5. The method of further comprisingtraining the AI system using the formed behavior pattern.6. The method of further comprisingretaining AI resulting data that includes an answer corresponding to each of the plurality of entities, a confidence value corresponding to each of ...

REAL DRIFT DETECTOR ON PARTIAL LABELED DATA IN DATA STREAMS

A computerized-method for real-time detection of real concept drift in predictive machine learning models, by processing high-speed streaming data. The computerized-method includes: receiving a real-time data stream having labeled and unlabeled instances. Obtaining a window of ‘n’ instances having a portion of the ‘n’ instances as reliable labels. Computing posterior distribution of the reliable labels; and operating a Drift-Detection (DD) module. The DD module is configured to: operate a kernel density estimation on the computed posterior distribution for sensitivity control of the DD module; operate an error rate function on the estimated kernel density to yield an error value; and train an incremental estimator module, according to the kernel density estimation. When the error value is not above a preconfigured drift threshold repeating operations (i) through (iii), else when the error value is above the preconfigured drift threshold, at least one concept drift related action takes place. 2. The computerized-method of claim 1 , wherein after obtaining a window of ‘n’ instances from the data stream claim 1 , the processor is further configured to:counting the labeled instances in the ‘n’ instances;multiplying a labeling cost by the counted labeled instances to yield a total-cost;when the total-cost is not above a preconfigured labeling budget:operating a Knowledge Discovery (KD) module to obtain reliable labels of the portion of the ‘n’ instances by applying one or more machine learning models; andperforming operations (ii) through (iii).3. The computerized-method of claim 2 , before the performing of operations (ii) through (iii) claim 2 , further comprising:initiating and training of a static estimator, according to the obtained reliable labels to provide the DD module a posterior distribution.4. The computerized-method of claim 1 , wherein the reliable labels of the portion of the ‘n’ instances are provided by an end-user before the obtaining of a window of ‘n’ ...

TRANSLATION OF A QUANTUM DESIGN ACROSS MULTIPLE APPLICATIONS

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. 1. A system , comprising:a memory that stores computer executable components; and 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; and', 'a quantum renderer component that translates the quantum geometry into a defined format of an application based on the data structure., 'a processor that executes the computer executable components stored in the memory, wherein the computer executable components comprise2. The system of claim 1 , wherein the quantum renderer component renders a visualization of at least one of the quantum geometry or the quantum component in the application at runtime of the application based on the data structure.3. The system of claim 1 , wherein the quantum renderer component performs at least one of a translation of a second quantum geometry into a second defined format of a second application or a rendering of a visualization of the second quantum geometry in the second application claim 1 , and wherein the second quantum geometry comprises a modified version of the quantum geometry.4. The system of claim 1 , wherein the quantum renderer component performs at least one of a translation ...

CALIBRATING MAJORANA QUBITS BY PROBING TOPOLOGICAL DEGENERACY

A method for use with a topological quantum computing device is provided. The method may include setting a plurality of device parameters for a qubit architecture including a plurality of Majorana zero modes (MZMs). The method may further include calibrating the plurality of device parameters at least in part by determining whether the plurality of MZMs exhibit ground state degeneracy. When the plurality of MZMs are determined to not exhibit ground state degeneracy, calibrating the plurality of device parameters may further include modifying one or more device parameters of the plurality of device parameters. When the plurality of MZMs are determined to exhibit ground state degeneracy, the method may further include modifying one or more parameters of a measurement device coupled to the qubit architecture. 1. A method for use with a topological quantum computing device , the method comprising:setting a plurality of device parameters for a qubit architecture including a plurality of Majorana zero modes (MZMs); determining whether the plurality of MZMs exhibit ground state degeneracy; and', 'modifying one or more device parameters of the plurality of device parameters when the plurality of MZMs are determined to not exhibit ground state degeneracy; and, 'calibrating the plurality of device parameters at least in part bymodifying one or more measurement device parameters of a measurement device coupled to the qubit architecture when the plurality of MZMs are determined to exhibit ground state degeneracy.2. The method of claim 1 , wherein determining whether the plurality of MZMs exhibit ground state degeneracy includes:measuring a conductance between a first MZM of the plurality of MZMs and a second MZM of the plurality of MZMs when the first MZM, the second MZM, and at least a third MZM of the plurality of MZMs are connected to respective electrical leads; anddetermining whether the plurality of MZMs exhibit ground state degeneracy based on the conductance.3. The ...

INCREASING GRAIN SIZE OF POLYCRYSTALLINE SUPERCONDUCTING MATERIALS FOR SUPERCONDUCTING CIRCUITS

A method of increasing grain size of polycrystalline superconducting materials for superconducting circuits, includes forming an initial superconducting epitaxial layer lattice matched to a substrate formed of a substrate material, the initial superconducting epitaxial layer formed of a compound including the substrate material and a first metal; and forming a second layer of the first metal on the initial superconducting epitaxial layer and heating the layers to increase a thickness of the initial superconducting epitaxial layer formed of the compound. 1. A quantum circuit including:a waveguide circuit arranged to provide electromagnetic radiation to a qubit,wherein at least one of the qubit and the waveguide circuit is formed to have elements including a superconducting epitaxial layer lattice matched to a substrate formed of a substrate material, the superconducting epitaxial layer formed of a compound including the substrate material and a first material.2. The quantum circuit of claim 1 , wherein the superconducting epitaxial layer is formed of the compound including the substrate material selected from the group consisting of silicon claim 1 , germanium claim 1 , sapphire claim 1 , and diamond claim 1 , and the first material selected from the group consisting of Co claim 1 , V claim 1 , Pt and Nb.3. A method of increasing grain size of polycrystalline superconducting materials for superconducting circuits claim 1 , comprising:forming an initial superconducting epitaxial layer lattice matched to a substrate formed of a substrate material, the initial superconducting epitaxial layer formed of a compound including the substrate material and a first metal; andforming a second layer of the first metal on the initial superconducting epitaxial layer and heating the layers to increase a thickness of the initial superconducting epitaxial layer formed of the compound.4. The method of claim 3 , wherein the substrate material comprises a semiconductor material.5. The ...

HOLDER, QUANTUM DEVICE, AND MANUFACTURING METHOD OF QUANTUM DEVICE

A quantum device includes a quantum chip and a holder. The holder includes a pedestal, a recess portion formed in a main surface of the pedestal so as to be opposed to the quantum chip, and a suction tube provided such that in the recess portion, a suction opening is positioned in a bottom surface of the quantum chip. 1. A quantum device comprising:a quantum chip; anda holder, whereinthe holder includes:a pedestal;a recess portion formed in a main surface of the pedestal so as to be opposed to the quantum chip; anda tube provided such that in the recess portion, an opening portion is positioned in a bottom surface of the quantum chip.2. The quantum device according to claim 1 , wherein the tube is configured to be attachable to and detachable from the pedestal.3. The quantum device according to claim 1 , further comprising:a waveguide arranged in the pedestal; anda bonding wire connecting the quantum chip and the waveguide together.4. The quantum device according to claim 3 , wherein the recess portion is formed so as to include a whole arrangement region of the quantum chip in a planar view.5. The quantum device according to claim 1 , wherein the recess portion is formed such that a portion of the pedestal supports the quantum chip.6. The quantum device according to claim 1 , wherein at least a portion of the quantum chip is configured with a superconductor material.7. A holder comprising:a pedestal;a recess portion formed in a main surface of the pedestal so as to be opposed to a quantum chip; anda tube provided such that in the recess portion, an opening portion is positioned in a bottom surface of the quantum chip.8. The holder according to claim 7 , wherein the tube is configured to be attachable to and detachable from the pedestal.9. A quantum device comprising:a quantum chip; anda holder having a pedestal,wherein the pedestal includes:a pedestal body;a first pedestal component configured to be attachable to and detachable from the pedestal body and having a ...

QUANTUM ENTANGLED STATE PROCESSING METHOD, DEVICE, AND STORAGE MEDIUM

A quantum entangled state processing method, a device, and a storage medium are provided, which are related to a field of quantum calculation. The specific implementation scheme includes: determining n initial quantum states to be processed; determining at least two nodes associated with the initial quantum state; acquiring at least one first parameterized quantum circuit required by the first node and at least one second parameterized quantum circuit required by the second node matched with a preset processing scenario; controlling, based on an initial quantum operation strategy, the first node to perform a local quantum operation to obtain a first measurement result, controlling the second node to perform a local quantum operation to obtain a second measurement result; obtaining an output quantum state meeting a preset requirement of the preset processing scenario at least based on the first measurement result and the second measurement result. 1. A quantum entangled state processing method , comprising:determining n initial quantum states to be processed, wherein each initial quantum state is at least an entangled quantum state formed by at least one first qubit in a first group of qubits and at least one second qubit in a second group of qubits;determining at least two nodes associated with the initial quantum state, wherein the first qubit is positioned at a first node of the at least two nodes, and the second qubit is positioned at a second node of the at least two nodes;acquiring at least one first parameterized quantum circuit required by the first node and at least one second parameterized quantum circuit required by the second node matched with a preset processing scenario;controlling, based on an initial quantum operation strategy, the first node to perform a local quantum operation on at least a portion of the first qubit in the first group of qubits by using the at least one first parameterized quantum circuit, to obtain a first measurement result, ...

METHOD AND DEVICE FOR PROCESSING QUANTUM DATA

A method and device for processing quantum data are provided, which are related to the field of quantum computation. The method includes: determining a quantum data set and category information characterizing a data type of the quantum data set; applying a local quantum circuit to a quantum data point contained in the quantum data set, wherein the local quantum circuit is obtained after part of qubits are selected from a plurality of qubits contained in a parameterized quantum circuit; acquiring state information of qubits in the local quantum circuit after being applied to the quantum data point through measurement, and taking the state information and the category information as training data for training a classical neural network to obtain a trained classical neural network, wherein a data type of a quantum data set to be processed can be identified by the trained classical neural network. 1. A method for processing quantum data , comprising:determining a quantum data set and category information characterizing a data type of the quantum data set;applying a local quantum circuit to a quantum data point contained in the quantum data set, wherein the local quantum circuit is obtained after part of qubits are selected from a plurality of qubits contained in a parameterized quantum circuit; andacquiring state information of qubits in the local quantum circuit after being applied to the quantum data point through measurement, and taking the state information and the category information as training data for training a classical neural network to obtain a trained classical neural network, wherein a data type of a quantum data set to be processed can be identified by the trained classical neural network.2. The method of claim 1 , further comprising:determining the parameterized quantum circuit, selecting part of qubits from the plurality of qubits contained in the parameterized quantum circuit, and taking a quantum circuit containing the selected part of qubits as the ...

Method and device for training tree model

A method and device for training a tree model based on a dataset are disclosed. The dataset comprises m pieces of sample data and m sample labels, each sample data comprises n features, the features and feature values in the dataset are ciphertexts, the method comprises: generating, for the dataset, candidate splits based on ciphertexts; partitioning, for each candidate split, the dataset into a left and right subset based on ciphertexts; calculating a partition coefficient of each candidate split based on the left and right subset obtained through partition for each candidate split; determining a feature in a target candidate split as an optimal feature, determining a threshold in the target candidate split as an optimal splitting value, the optimal feature and the optimal splitting value are ciphertexts; assigning the dataset to two child nodes of the current node based on the optimal feature and the optimal splitting value.