108 results about "Quantum register" patented technology

Methods and systems are disclosed for manipulating quantum data in a real quantum basis. The method comprises formulating one or more quantum circuits including an amplitude-based feature map comprising gate operations for encoding one or more input features in a Hilbert space of quantum elements of a quantum register. The gate operations are configured to encode the one or more classical input features in amplitudes of a set of orthogonal basis states of the quantum register, wherein the amplitudes are based on one or more basis functions. This also includes a method for executing a transform associated with the feature map on a quantum processor comprising a quantum register. The method comprises preparing the quantum register in a first state representing a computational basis state; formulating a transform circuit configured to map a computational basis state to a feature- map-associated basis state; and applying the transform circuit to the quantum register.

Methods and systems are disclosed for solving a differential problem using a hybrid computer system. The differential problem defines a differential equation, and a target function defines an approximate solution to the differential equation. The target function is defined as a sum of basis functions with parameterized coefficients. The method comprises receiving or determining a quantum circuit defining operations of a parameterized quantum model of the differential equation, and determining the solution to the differential problem based on the parameterized quantum model and, optionally, a loss function associated with the differential problem. The quantum circuit defines operations for encoding primitive elements (e.g., terms such as f(x), f(x) / dx, g(x), etc.) of the differential equation in a plurality of quantum states of quantum elements of the quantum processor. Each quantum state of the plurality of quantum states corresponds to a set of (parametrized or unparametrized) coefficients associated with the basis functions, of which at least one quantum state of the plurality of quantum states corresponds to a set of parametrized coefficients associated with the basis functions. The determination of the solution includes varying the variational parameters to determine a set of optimal parameters. The varying of the variational parameters includes: translating the operations of the quantum circuit into control signals for control and readout of the quantum elements of the quantum register; applying the operations of the quantum circuit to the quantum elements based on the control signals; determining classical measurement data by measuring one or more comparisons, e.g. overlaps, between pairs of quantum states from the plurality of quantum states; computing a loss value based on the loss function and the classical measurement data; and adjusting the variational parameters based on the loss value.

A method and system for solving a computational problem using a hybrid data processor comprising a classical computer and quantum computer the method comprising receiving or determining information on one or more quantum circuits defining operations of a parameterized quantum model of a target function, the target function representing an approximate solution to the computational problem, preferably one or more differential equations and one or more associated boundary conditions, the one or more quantum circuits comprising one or more quantum feature maps for encoding one or more classical input features associated with the target function into the Hilbert space of the quantum register, wherein the one or more feature maps include one or more unitary operators defining a time evolution over a Hamiltonian, preferably a generator Hamiltonian, applied to quantum elements of the quantum register, the Hamiltonian evolution being parameterized by a first set of variational parameters and the one or more classical input features; and, determining the target function based on the parameterized quantum model and a loss function associated with the computational problem, the determining including varying the first set of variational parameters to determine a set of eigenfrequencies of the Hamiltonian which is optimized for the computational problem, the set of eigenfrequencies defining quantum modes, which the parameterized quantum.

A method and system for solving a computational problem using a hybrid data processor comprising a classical computer and quantum computer the method comprising receiving or determining information on one or more quantum circuits defining operations of a parameterized quantum model of a target function, the target function representing an approximate solution to the computational problem, preferably one or more differential equations and one or more associated boundary conditions, the one or more quantum circuits comprising one or more quantum feature maps for encoding one or more classical input features associated with the target function into the Hilbert space of the quantum register, wherein the one or more feature maps include one or more unitary operators defining a time evolution over a Hamiltonian, preferably a generator Hamiltonian, applied to quantum elements of the quantum register, the Hamiltonian evolution being parameterized by a first set of variational parameters and the one or more classical input features; and, determining the target function based on the parameterized quantum model and a loss function associated with the computational problem, the determining including varying the first set of variational parameters to determine a set of eigenfrequencies of the Hamiltonian which is optimized for the computational problem, the set of eigenfrequencies defining quantum modes, which the parameterized quantum.

Methods and systems are disclosed for manipulating quantum data in the Chebyshev basis. The method comprises formulating one or more quantum circuits including a Chebyshev feature map comprising gate operations for encoding one or more input features in a Hilbert space of quantum elements of a quantum register. The gate operations are configured to encode the one or more classical input features in amplitudes of a set of orthogonal basis states of the quantum register, wherein the amplitudes are based on one or more Chebyshev polynomials. This also includes a method for executing a Chebyshev transform on a quantum processor comprising a quantum register. The method comprises preparing the quantum register in a first state representing a computational basis state; formulating a transform circuit configured to map a computational basis state to a Chebyshev basis state; and applying the transform circuit to the quantum register.

A method of performing state estimation for a microgrid system includes: obtaining a general quantum state estimation model for swing-bus-contained microgrid systems; establishing a state estimation formulation through quantum language; assigning quantum registers used during a quantum state estimation iteration; generating a quantum-circuit-based state estimation solver for performing quantum phase estimation, controlled rotation, and inverse quantum phase estimation; generating a preconditioned quantum linear solver for an ill-conditioned state estimation iteration; iteratively optimizing voltage and residual vectors while iteratively updating preconditioned errors by the state estimation solver, the optimizing and updating iterations continuing until the linear solver reaches convergence; obtaining a quantum state estimation model for hierarchical-based microgrid systems including droop and / or secondary control modes; establishing an enhanced quantum state estimation framework including the state estimation solver and the linear solver; and generating an enhanced state estimation output for controlling one or more parameters of the microgrid system.

A quantum computing device initiates a first quantum algorithm comprising a test method implemented as a quantum oracle, the first quantum algorithm receiving an input of a first quantum register comprising one or more qubits and a second quantum register comprising one qubit, each qubit in the first quantum register corresponding to a test case for the test method. The quantum computing device receives an output of the first quantum algorithm. The quantum computing device initiates a second quantum algorithm, the second quantum algorithm receiving an input of a third quantum register and the output of the first quantum algorithm. The quantum computing device performs a measurement on the first quantum register and a measurement on the third quantum register. The quantum computing device determines, based on the measurement on the first quantum register and the measurement on the third quantum register, that the test method passed or failed.

Methods and systems are disclosed for solving a differential problem using a hybrid computer system. The differential problem defines a differential equation, and a target function defines an approximate solution to the differential equation. The target function is defined as a sum of basis functions with parameterized coefficients. The method comprises receiving or determining a quantum circuit defining operations of a parameterized quantum model of the differential equation, and determining the solution to the differential problem based on the parameterized quantum model and, optionally, a loss function associated with the differential problem. The quantum circuit defines operations for encoding primitive elements (e.g., terms such as f(x), f(x) / dx, g(x), etc.) of the differential equation in a plurality of quantum states of quantum elements of the quantum processor. Each quantum state of the plurality of quantum states corresponds to a set of (parametrized or unparametrized) coefficients associated with the basis functions, of which at least one quantum state of the plurality of quantum states corresponds to a set of parametrized coefficients associated with the basis functions. The determination of the solution includes varying the variational parameters to determine a set of optimal parameters. The varying of the variational parameters includes: translating the operations of the quantum circuit into control signals for control and readout of the quantum elements of the quantum register; applying the operations of the quantum circuit to the quantum elements based on the control signals; determining classical measurement data by measuring one or more comparisons, e.g. overlaps, between pairs of quantum states from the plurality of quantum states; computing a loss value based on the loss function and the classical measurement data; and adjusting the variational parameters based on the loss value.

Disclosed is an approach for learning probability distributions as differentiable quantum circuits (DQC) that enable efficient quantum generative modelling (QGM) and synthetic data generation. A method includes training of a differentiable quantum circuits (DCQ) based model, where data is encoded in a latent space with a phase feature map, followed by a variational quantum circuit. The trained model is then mapped to the bit basis using a fixed unitary transformation, coinciding with a quantum Fourier transform circuit in the simplest case. This allows fast sampling from parametrized distributions using a single-shot readout. Simplified latent space training provides models that are automatically differentiable. Samples from propagated stochastic differential equations (SDEs) can be accessed by solving a stationary Fokker-Planck equation and time-dependent Kolmogorov backward equation on a quantum computer. A route to multidimensional generative modelling is opened with qubit registers explicitly correlated via a (fixed) entangling layer.

The invention relates to the technical field of quantum cryptographic analysis, in particular to a parallelization solution optimization method and system for a quantum cryptographic analysis Grover-mets-Simon problem, and aims at solving the Grover-mets-Simon problem by verifying whether an object function in a quantum cryptographic algorithm meets a solution condition or not and constructing a truncated periodic function for the met object function. The solution search space is divided into a parallel solution high bit string period solution space and a general solution low bit string period solution space; solving the truncated periodic function in a parallel high-bit string periodic solving space by using a quantum register according to a parallel Grover-mets-Simon algorithm, so as to obtain quantum key algorithm periodic data through a plurality of parallel Simon threads; and a Grover-mets-Simon algorithm is utilized to carry out supplementary solution on the periodic function in a general low-bit string periodic solution space so as to obtain a quantum key algorithm key and periodic residual bits. According to the method, the depth, width and gate circuit expenditure of the quantum circuit required by quantum cryptographic analysis solution can be flexibly adjusted by adjusting truncation parameters.

A method for operating a quantum register. The method includes: carrying out of a first read-out process, so that first data representing a first state of the quantum register are ascertained; first control of the quantum register, which is in the first state, in accordance with a quantum gate; carrying out of a second read-out process, so that second data representing a second state of the quantum register which results from the first control are ascertained; adjustment of at least one parameter of the quantum gate using the first data and the second data in order to optimize a target function which is dependent on the first data and on the second data; second control of the quantum register in accordance with the quantum gate which results from the adjustment.

The invention relates to the technical field of short-term electric quantity regulation and control, in particular to an electric quantity regulation and control method and system based on a quantum algorithm and a neural network in an electric power market environment. According to the method, a plurality of quantum registers are constructed to form a population and are initialized, the quantum registers are individuals representing market decisions, and the market decisions are sets of declared quantity-price curves of all participants in the electricity market; the quantum code of one participant is selected from each quantum register to serve as a candidate solution, the fitness of the candidate solution is evaluated, and updating variation is conducted on half of the quantum registers with the smaller fitness of the candidate solution so as to iterate the population; when the number of population iterations reaches a set threshold value, selecting an individual which meets the constraint conditions of each participant and has the maximum optimization target as an optimal declaration strategy; obtaining a declaration quantity price decision of each participant through optimal declaration strategy inverse quantum coding; the optimization objective as the individual's market decision is to maximize the sum of producer and consumer residuals. According to the method, the defect of poor power resource configuration efficiency in the prior art is overcome, market decision optimization is performed in combination with the quantum genetic algorithm, declaration reference is provided for each participant, so that clearing power is improved, power configuration is optimized, and configuration efficiency is improved.

A method for suppressing dephasing of a resting qubit (qb1) in a quantum register comprising a plurality of qubits (qb1, qb2, qb3, qb4) is specified, comprising the step of applying an identity pulse (1) to the resting qubit (qb1), wherein the identity pulse (1) implements an identity operation on the resting qubit (qb1). Furthermore, a quantum computer is specified.

A method, apparatus, and system for counting events. a set of quantum registers is reset. A Hadamard operator is applied to the set of quantum registers. A quantum instruction is executed on the set of quantum registers, wherein the quantum instruction incorporates a function for an event vector comprising events identified by bits. The Hadamard operator is applied to the set of quantum registers after executing the quantum instruction. The set of quantum registers is measured to form a measurement of the set of quantum registers. An approximate count of the events is determined using the measurement of the set of quantum registers.

Provided in the present application are a quantum circuit construction method and apparatus, and a device, a storage medium and a product. The method comprises: preparing, on the basis of a modulus N, a first quantum register that comprises 2n first quantum bits and a second quantum register that comprises n first quantum bits, n being the binary expansion length of the modulus N; obtaining an equal-probability quantum superposition state of the first quantum register by constructing a Hadamard gate; constructing a first modular multiplication module and 2n-1 second modular multiplication modules on the second quantum register; sequentially using a plurality of first quantum bits as control bits, sequentially using the first modular multiplication module and the 2n-1 second modular multiplication modules as controlled parties, and constructing 2n controlled unitary gates; and performing inverse Fourier transformation and measurement on the first quantum register to obtain a phase estimation result corresponding to a modular function period r. The solution of the present application provides support for solving the problem of larger-scale computation.

According to one aspect, the subject matter of the present description is a method for allocating logical qubits of a quantum algorithm to physical qubits of a quantum processor arranged according to a given architecture, the method including: establishing, from the architecture, a connectivity graph; the establishing, from the quantum algorithm, a graph of the logical operations; assigning a weight to each logical qubit; ranking the logical qubits according to the weight; allocating a first logical qubit chosen according to the weight, to a first physical qubit of the quantum register; iteratively allocating the logical qubits remaining to be allocated, including calculating a score; and reproducing the iterative allocation procedure until allocating the last logical qubit remaining to be allocated, thus resulting in obtaining a configuration for allocating logical qubits of the quantum algorithm to physical qubits of the quantum processor.

Systems, methods, computer-readable media, and techniques disclosed herein provide for preparing a solution to a problem comprising a constraint on a non-classical computer, comprising: (a) providing a state preparation operation, wherein the state preparation operation comprises at least a portion of an implementation of the problem comprising the constraint on the non-classical computer, wherein the state preparation operation is configured to evolve a quantum register to a solution state; (b) applying a constraint detection operation, the constraint detection operation comprising entangling an ancilla qubit with a set of data qubits; and (c) measuring the ancilla qubit to determine whether a constraint of the problem is satisfied.

Quantum computing devices, circuits, and methods for performing a quantum multiplication of two numbers. A first quantum register is prepared in a first state indicative of a first number, and a second quantum register is prepared in a second state indicative of a second number. A third quantum register is prepared in an initial state. Each of a plurality of controlled bidirectional addition circuits performs controlled bidirectional addition of the second number into the third quantum register, controlled on a respective qubit of the first plurality of qubits. A plurality of correction operator circuits operates on the first, second and third quantum registers to remove discrepancies between performing controlled bidirectional addition and performing controlled addition. Qubits in the third quantum register are output in a prepared state indicative of a product of the first and second numbers.

The application belongs to the technical field of secret communication, and discloses a mixed quantum and classical symmetric encryption key security analysis method, receives a plurality of pairs of known plaintext and ciphertext data, constructs a Hamiltonian operator for each pair, makes a quantum state corresponding to correct ciphertext a ground state, divides a key into two segments, and circularly traverses all values of the first segment; in each cycle, a parameterized superposition state composed of all values of the second segment is constructed on a quantum register, and is input into a quantum encryption circuit together with a plaintext quantum state to generate a ciphertext superposition state, a cost function is obtained by measuring a weighted average of Hamiltonian expectation value, and a parameter is optimized by using a quantum variation algorithm until the ciphertext superposition state converges to a state corresponding to a correct key, and the second segment key can be determined by measuring the optimized quantum state, and the complete key is analyzed in combination with the value of the first segment. The method has the advantages of classical enumeration and quantum optimization, reduces the number of quantum bits while maintaining high analysis efficiency.

A topological quantum register comprises an array of topological qubits on a substrate. A reconfigurable quantum register also comprises an electrically conducting lead connecting each quantum bit to at least one other quantum bit and has a solid state switch. A topological quantum register also has means for determining quantum states of the quantum bits simultaneously, means for establishing a superposition state in each of the quantum bits; and a computer in communication with each of said solid state switches.

Systems and methods involving quantum machines, hybrid quantum machines, aspects of quantum information technology and / or other features are disclosed. In one exemplary implementation, a system is provided comprising a quantum register that stores quantum information using qubits, wherein the qubits are configured to store the quantum information using particles or objects arranged in a lattice of quantum gates, a clock that provides a clock cycle to the quantum register, and a qubit-tie computing component coupled to the quantum register, wherein the qubit-tie computing component is configured to shift the quantum information between the qubits, wherein the system stores the qubits in different states using physical qualities, which may define qubits that are configured to be entangled and superposed at a same time. Further, the quantum register may comprise an entanglement component, and / or the qubit-tie computing component may comprise a superposition component.

The present disclosure relates to a method comprising: providing a quantum register comprising a set of qubits defining a quantum system. The states of a computational basis of the quantum system may be represented by an ordered set of consecutive nonnegative integer numbers, referred to as a set of indexes. A random variable may be determined in accordance with a predefined classical-quantum format, wherein the random variable is valued in a finite domain of classical values such that each value of the domain is derived from a respective index of the set of indexes through an affine relationship, the affine relationship being defined by a scaling factor and an offset factor. The set of qubits may be encoded such that the probability of measuring a state of the quantum system in the computational basis is the probability of observing the domain value associated with the index representing said measured state when sampling the random variable.

A quantum computer architecture and a method for solving quantum chemical problems are provided, comprising: determining and storing (135) an approximate ground state for the Hamiltonian H using a classical computer (130); modeling the approximate ground state on a first quantum register (210) of a quantum computing unit QPU (240); modeling the time evolution operator (230) as a gate sequence of the QPU (240) and executing (145) the same; modeling a measurement operator x on one of the QPU (240); reading and storing (155) the measurement operator according to time evolution to obtain an approximation for the ground state value E0 (260) of H, wherein the determination of the approximate ground state is carried out using a Density Matrix Renormalization Group DMRG.

In a method to digitally simulate an evolving quantum state of a qubit register of a quantum computer, the quantum state is represented as a state vector of complex-valued amplitudes, where each amplitude is associated with an individual qubit of the qubit register. A directed acyclic graph defining a set of quantum gates of a quantum-computer program is then received. A linear order for the DAG is constructed by minimizing a partial cost function successively re-computed during construction of the linear order, the partial cost function approximating a cost of transforming the state vector according to a subset of the set of quantum gates applied in the linear order. The state vector is transformed according to the set of quantum gates applied in the linear order, and one or more of the complex-valued amplitudes of the transformed state vector are computationally output.

A quantum source coding method includes: initializing a quantum register having a plurality of nodes: loading a unary-coded message into the quantum register; loading an address state into an address register of each message node of the quantum register; sorting the message nodes based on a data register such that the message nodes form a message-sorted sequence; and applying, for each message node at an end of the message-sorted sequence, a CNOT gate to the address state of each of the register's message nodes and output nodes. The method also includes: unsorting the message nodes; sorting the nodes based on the address register such that the nodes form a fully-sorted sequence; applying, for each pair of adjacent nodes in the fully-sorted sequence having the same address state, a CNOT gate to the data registers of each pair; and unsorting the nodes to return the fully-sorted sequence to the initial sequence.

The invention relates to a tunable nanobeam cavity resonator (100) comprising a first optical cavity (102) a second optical cavity (104) optically coupled to the first optical cavity (102) an electrically conductive portion (106) and an electrode (108), wherein the first optical cavity (102) and / or the second optical cavity (104) comprise / comprises a quantum emitter configured to host a qubit. The first optical cavity (102) and the second optical cavity (104) are provided in the tunable nanobeam cavity resonator (100) such that there is a gap (110) between the first optical cavity (102) and the second optical cavity (104). The electrically conductive portion (106) is configured to move with respect to the electrode (108) and the first optical cavity (102) when a voltage between the electrically conductive portion (106) and the electrode (108) is applied; and the electrically conductive portion (106) is mechanically connected to the second optical cavity (104) such that movement of the electrically conductive portion (106) causes movement of the second optical cavity (104) with respect to the first optical cavity (102) to adjust the gap (110) between the first optical cavity (102) and the second optical cavity (104).

Methods and systems for processing quantum jobs by a hybrid computing system comprising a classical computer system and one or more atomic qubit-based quantum processing units (QPUs), wherein the method may comprise receiving or determining one or more batches of quantum jobs by the classical computer system, each quantum job being associated with register layout information defining a layout of a quantum register for execution of the quantum job, each batch being associated with trap layout information defining a layout of an electromagnetic trap for trapping atomic qubits, the trap layout of a batch being defined such that register layouts associated with jobs of the batch can be mapped onto the trap layout; selecting a batch of quantum jobs from the one or more batches of quantum jobs and configuring a first trap for a first QPU of the one or more QPUs based on trap layout information associated with the selected batch; and, executing the selected batch of quantum jobs using the first QPU.

Methods and systems for processing quantum jobs by a hybrid computing system comprising a classical computer system and one or more atomic qubit-based quantum processing units (QPUs), wherein the method may comprise receiving or determining one or more batches of quantum jobs by the classical computer system, each quantum job being associated with register layout information defining a layout of a quantum register for execution of the quantum job, each batch being associated with trap layout information defining a layout of an electromagnetic trap for trapping atomic qubits, the trap layout of a batch being defined such that register layouts associated with jobs of the batch can be mapped onto the trap layout; selecting a batch of quantum jobs from the one or more batches of quantum jobs and configuring a first trap for a first QPU of the one or more QPUs based on trap layout information associated with the selected batch; and, executing the selected batch of quantum jobs using the first QPU.

A method of implanting atoms into a substrate is disclosed where the atoms are at least some of the constituent atoms of a molecule that has one or more color center atom(s) and one or more satellite atom(s). The molecule may comprise not more than three color center atoms of the same element of the group. The molecule may comprise one or more color center atom(s) other than N, at least six satellite atoms of N, and / or one or more satellite atoms other than 13C. A quantum register comprising a color center and at least one nuclear spin isotope atom in a substrate is manufactured using the color center of the quantum register formed by a color center atom implanted into the substrate. A quantum register with such color center and at least one nuclear spin isotope atom in a substrate is disclosed.

The present invention relates to a tunable nanobeam cavity resonator (100), the tunable nanobeam cavity resonator comprising: a first optical cavity (102); a second optical cavity (104), the second optical cavity being optically coupled to the first optical cavity (102); a conductive portion (106); and an electrode (108), wherein the first optical cavity (102) and / or the second optical cavity (104) comprises a quantum emitter configured to carry quantum bits. The first optical cavity (102) and the second optical cavity (104) are disposed in the tunable nanobeam cavity resonator (100) such that there is a gap (110) between the first optical cavity (102) and the second optical cavity (104). The conductive portion (106) is configured to move relative to the electrode (108) and the first optical cavity (102) when a voltage is applied between the conductive portion (106) and the electrode (108); the conductive portion (106) is mechanically connected to the first optical cavity (102) and the conductive portion (106) is mechanically connected to the second optical cavity (104) such that movement of the conductive portion (106) causes movement of the second optical cavity (104) relative to the first optical cavity (102) to adjust the gap (110) between the first optical cavity (102) and the second optical cavity (104).