Patent classifications
G06N10/00
SELF-RESETTING SINGLE FLUX-QUANTUM MICROWAVE PHOTODETECTOR
The disclosure relates to a quantum detector configured to receive a microwave signal from a microwave source. The quantum detector comprises a main element formed by a main Josephson junction and a Josephson transmission line which is coupled to the main element for outputting a measurement signal. The Josephson transmission line comprises at least a first set of JTL elements and a second set of JTL elements. The capacitively shunted Josephson junction in each JTL element in the first set is weakly damped, and the JTL element in the second set are more strongly damped than the JTL elements in the first set.
METHOD FOR ERROR REDUCTION IN A QUANTUM COMPUTER
It is already known that quantum computers can be used to simulate materials and molecules. However, quantum computers are error-prone and exhibit intrinsic noise, which has so far made the real technical application of quantum computers impossible. Approaches are already known from the prior art which, despite the error susceptibility, allow meaningful simulations of quantum mechanical systems to be created, but the errors still exist. Building on this, the invention now makes it possible to reduce the errors and to include the errors as part of the simulation. In addition, the invention makes it possible to inhibit the effect of intrinsic noise. This further improves the technical applicability of quantum computers for simulating materials and molecules.
A MULTI CHANNEL FILTER FOR LOW ELECTRON TEMPERATURES
A multi-channel filter with a PCB with a first side with signalling tracks and shielding tracks between neighbouring signalling tracks. On the second side, a conductive layer is provided. The signalling tracks are covered by an electromagnetically absorbing material, such as a powder of an electrically conducting material is provided. The filter may have sections with reversed structure where the conductors are on the second side and the layer on the first side, where the conductors on opposite sides are interconnected. The filter may be rolled or folded.
ENHANCED QUANTUM CIRCUIT OPERATION VIA A UNIVERSALLY IMPLEMENTABLE 4X4 UNITARY MATRIX DECOMPOSITION
Systems, computer-implemented methods and/or computer program products are provided to facilitate operation of a quantum circuit on a set of qubits via providing and implementing decompositions of one or more unitary matrices. According to an embodiment, a system can implement a unitary matrix by providing and implementing a decomposition of the unitary matrix, to thereby facilitate operation of and/or operate a quantum circuit on a set of qubits. The 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 unitary matrix management component that decomposes a defined 4×4 unitary matrix into a defined circuit comprising a sequence of universal gates. The sequence of universal gates can be a same sequence for each defined 4×4 unitary matrix of a set of candidate 4×4 unitary matrices including the defined 4×4 unitary matrix.
ENHANCED QUANTUM CIRCUIT OPERATION VIA A UNIVERSALLY IMPLEMENTABLE 4X4 UNITARY MATRIX DECOMPOSITION
Systems, computer-implemented methods and/or computer program products are provided to facilitate operation of a quantum circuit on a set of qubits via providing and implementing decompositions of one or more unitary matrices. According to an embodiment, a system can implement a unitary matrix by providing and implementing a decomposition of the unitary matrix, to thereby facilitate operation of and/or operate a quantum circuit on a set of qubits. The 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 unitary matrix management component that decomposes a defined 4×4 unitary matrix into a defined circuit comprising a sequence of universal gates. The sequence of universal gates can be a same sequence for each defined 4×4 unitary matrix of a set of candidate 4×4 unitary matrices including the defined 4×4 unitary matrix.
TIME MANAGEMENT FOR ENHANCED QUANTUM CIRCUIT OPERATION EMPLOYING A HYBRID CLASSICAL/QUANTUM SYSTEM
Systems, computer-implemented methods and/or computer program products are provided for facilitating time management of a quantum program at one or more nodes of a system, such as a hybrid classical/quantum system. A system, such as a classic portion of the hybrid 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 time management component that can communicate with a node to trigger the node to execute one or more quantum program instructions relative to a counter of the node that is advanced by the communicating. The time management component can advance the counter at the node based upon a combination of time of another node and of a determined actual propagation time for the communicating.
TIME MANAGEMENT FOR ENHANCED QUANTUM CIRCUIT OPERATION EMPLOYING A HYBRID CLASSICAL/QUANTUM SYSTEM
Systems, computer-implemented methods and/or computer program products are provided for facilitating time management of a quantum program at one or more nodes of a system, such as a hybrid classical/quantum system. A system, such as a classic portion of the hybrid 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 time management component that can communicate with a node to trigger the node to execute one or more quantum program instructions relative to a counter of the node that is advanced by the communicating. The time management component can advance the counter at the node based upon a combination of time of another node and of a determined actual propagation time for the communicating.
Quantum Rating System
A method of rating credit risk is provided. The method comprises calculating a number of credit risk factors associated with a financial instrument, wherein each credit risk factor is calculated iteratively at a first timestep as a discrete probabilistic wave function representing a superposition state of scores. The discrete probabilistic wave function of each credit risk factor is measured after each calculation iteration for the first timestep. The probabilistic wave functions of the credit risk factors are then linearly combined to calculate a discrete probabilistic wave function for a final credit rating of the financial instrument for the first timestep, which is displayed in a user interface. The above steps are repeated for a second timestep using the probabilistic wave functions of the credit risk factors at the first timestep as initial states for the second timestep.
Quantum Rating System
A method of rating credit risk is provided. The method comprises calculating a number of credit risk factors associated with a financial instrument, wherein each credit risk factor is calculated iteratively at a first timestep as a discrete probabilistic wave function representing a superposition state of scores. The discrete probabilistic wave function of each credit risk factor is measured after each calculation iteration for the first timestep. The probabilistic wave functions of the credit risk factors are then linearly combined to calculate a discrete probabilistic wave function for a final credit rating of the financial instrument for the first timestep, which is displayed in a user interface. The above steps are repeated for a second timestep using the probabilistic wave functions of the credit risk factors at the first timestep as initial states for the second timestep.
QUANTUM SIMULATION
A method for reducing computation time while simulating quantum computation on a classical computer by performing an algorithm used to determine the most efficient input contraction, the method including receiving, by a processor, a tensor network representing a quantum circuit, computing, by the processor, an ordering for the tensor network by an ordering algorithm, contracting, by the processor, the tensor network by eliminating indices according to the ordering resulting in a contracted tensor network, and returning, by the processor, the contracted tensor network.