Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian.

ABSTRACT: Prime factorization (P = M × N) is a promising application for quantum computing. Shor's algorithm is a key concept for breaking the limit for analyzing P, which cannot be effectively solved by classical computation; however, the algorithm requires error-correctable logical qubits. Here, we describe a quantum annealing method for solving prime factorization. A superconducting quantum circuit with native implementation of the multiplier Hamiltonian provides combinations of M and N as a solution for number P after annealing. This circuit is robust and can be expanded easily to scale up the analysis. We present an experimental and theoretical exploration of the multiplier unit. We demonstrate the 2-bit factorization in a circuit simulation and experimentally at 10 mK. We also explain how the current conditions can be used to obtain high success probability and all candidate factorized elements.

SUBMITTER: Saida D

PROVIDER: S-EPMC9372081 | biostudies-literature | 2022 Aug

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian.

Saida Daisuke D Hidaka Mutsuo M Imafuku Kentaro K Yamanashi Yuki Y

Scientific reports 20220811 1

Prime factorization (P = M × N) is a promising application for quantum computing. Shor's algorithm is a key concept for breaking the limit for analyzing P, which cannot be effectively solved by classical computation; however, the algorithm requires error-correctable logical qubits. Here, we describe a quantum annealing method for solving prime factorization. A superconducting quantum circuit with native implementation of the multiplier Hamiltonian provides combinations of M and N as a solution f ...[more]

PMID: 35953585

Similar Datasets

High-performance superconducting quantum processors via laser annealing of transmon qubits.

Project description:Scaling the number of qubits while maintaining high-fidelity quantum gates remains a key challenge for quantum computing. Presently, superconducting quantum processors with >50 qubits are actively available. For these systems, fixed-frequency transmons are attractive because of their long coherence and noise immunity. However, scaling fixed-frequency architectures proves challenging because of precise relative frequency requirements. Here, we use laser annealing to selectively tune transmon qubits into desired frequency patterns. Statistics over hundreds of annealed qubits demonstrate an empirical tuning precision of 18.5 MHz, with no measurable impact on qubit coherence. We quantify gate error statistics on a tuned 65-qubit processor, with median two-qubit gate fidelity of 98.7%. Baseline tuning statistics yield a frequency-equivalent resistance precision of 4.7 MHz, sufficient for high-yield scaling beyond 103 qubit levels. Moving forward, we anticipate selective laser annealing to play a central role in scaling fixed-frequency architectures.

| S-EPMC9106287 | biostudies-literature

Quantum Annealing for Prime Factorization.

Project description:We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function then transforming the k-bit coupling (k ≥ 3) terms to quadratic terms using ancillary variables. Our resource-efficient method uses [Formula: see text] binary variables (qubits) for finding the factors of an integer N. We present how to factorize 15, 143, 59989, and 376289 using 4, 12, 59, and 94 logical qubits, respectively. This method was tested using the D-Wave 2000Q for finding an embedding and determining the prime factors for a given composite number. The method is general and could be used to factor larger integers as the number of available qubits increases, or combined with other ad hoc methods to achieve better performances for specific numbers.

| S-EPMC6281593 | biostudies-literature

Prime factorization using quantum annealing and computational algebraic geometry.

Project description:We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gröbner bases can be used to reduce the degree of Hamiltonians.

| S-EPMC5318873 | biostudies-literature

Superconducting quantum circuit of NOR in quantum annealing.

Project description:The applicability of quantum annealing to various problems can be improved by expressing the Hamiltonian using a circuit satisfiability problem. We investigate the detailed characteristics of the NOR/NAND functions of a superconducting quantum circuit, which are the basic building blocks to implementing various types of problem Hamiltonians. The circuit is composed of superconducting flux qubits with all-to-all connectivity, where direct magnetic couplers are utilized instead of the variable couplers in the conventional superconducting quantum circuit. This configuration provides efficient scalability because the problem Hamiltonian is implemented using fewer qubits. We present an experiment with a complete logic operation of NOR/NAND, in which the circuit produces results with a high probability of success for arbitrary combinations of inputs. The features of the quantum circuit agree qualitatively with the theory, especially the mechanism for an operation under external flux modulation. Moreover, by calibrating the bias conditions to compensate for the offset flux from the surrounding circuit, the quantum circuit quantitatively agrees with the theory. To achieve true quantum annealing, we discuss the effects of the reduction in electric noise in quantum annealing.

| S-EPMC9508137 | biostudies-literature

Coherent controlization using superconducting qubits.

Project description:Coherent controlization, i.e., coherent conditioning of arbitrary single- or multi-qubit operations on the state of one or more control qubits, is an important ingredient for the flexible implementation of many algorithms in quantum computation. This is of particular significance when certain subroutines are changing over time or when they are frequently modified, such as in decision-making algorithms for learning agents. We propose a scheme to realize coherent controlization for any number of superconducting qubits coupled to a microwave resonator. For two and three qubits, we present an explicit construction that is of high relevance for quantum learning agents. We demonstrate the feasibility of our proposal, taking into account loss, dephasing, and the cavity self-Kerr effect.

| S-EPMC4678369 | biostudies-literature

Robustly learning the Hamiltonian dynamics of a superconducting quantum processor.

Project description:Precise means of characterizing analog quantum simulators are key to developing quantum simulators capable of beyond-classical computations. Here, we precisely estimate the free Hamiltonian parameters of a superconducting-qubit analog quantum simulator from measured time-series data on up to 14 qubits. To achieve this, we develop a scalable Hamiltonian learning algorithm that is robust against state-preparation and measurement (SPAM) errors and yields tomographic information about those SPAM errors. The key subroutines are a novel super-resolution technique for frequency extraction from matrix time-series, tensorESPRIT, and constrained manifold optimization. Our learning results verify the Hamiltonian dynamics on a Sycamore processor up to sub-MHz accuracy, and allow us to construct a spatial implementation error map for a grid of 27 qubits. Our results constitute an accurate implementation of a dynamical quantum simulation that is precisely characterized using a new diagnostic toolkit for understanding, calibrating, and improving analog quantum processors.

| S-EPMC11542007 | biostudies-literature

An opto-magneto-mechanical quantum interface between distant superconducting qubits.

Project description:A quantum internet, where widely separated quantum devices are coherently connected, is a fundamental vision for local and global quantum information networks and processing. Superconducting quantum devices can now perform sophisticated quantum engineering locally on chip and a detailed method to achieve coherent optical quantum interconnection between distant superconducting devices is a vital, but highly challenging, goal. We describe a concrete opto-magneto-mechanical system that can interconvert microwave-to-optical quantum information with high fidelity. In one such node we utilise the magnetic fields generated by the supercurrent of a flux qubit to coherently modulate a mechanical oscillator that is part of a high-Q optical cavity to achieve high fidelity microwave-to-optical quantum information exchange. We analyze the transfer between two spatially distant nodes connected by an optical fibre and using currently accessible parameters we predict that the fidelity of transfer could be as high as ~80%, even with significant loss.

| S-EPMC4081873 | biostudies-literature

Demonstration of a quantum error detection code using a square lattice of four superconducting qubits.

Project description:The ability to detect and deal with errors when manipulating quantum systems is a fundamental requirement for fault-tolerant quantum computing. Unlike classical bits that are subject to only digital bit-flip errors, quantum bits are susceptible to a much larger spectrum of errors, for which any complete quantum error-correcting code must account. Whilst classical bit-flip detection can be realized via a linear array of qubits, a general fault-tolerant quantum error-correcting code requires extending into a higher-dimensional lattice. Here we present a quantum error detection protocol on a two-by-two planar lattice of superconducting qubits. The protocol detects an arbitrary quantum error on an encoded two-qubit entangled state via quantum non-demolition parity measurements on another pair of error syndrome qubits. This result represents a building block towards larger lattices amenable to fault-tolerant quantum error correction architectures such as the surface code.

| S-EPMC4421819 | biostudies-literature

Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian.

Project description:Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial state to a low energy state of a target Ising Hamiltonian of quantum spins, HI. Here, we point to the existence of an analytical solution for such a problem for an arbitrary HI beyond the adiabatic limit for QA. This solution provides insights into the accuracy of nonadiabatic computations. Our QA protocol in the pseudo-adiabatic regime leads to a monotonic power-law suppression of nonadiabatic excitations with time T of QA, without any signature of a transition to a glass phase, which is usually characterized by a logarithmic energy relaxation. This behavior suggests that the energy relaxation can differ in classical and quantum spin glasses strongly, when it is assisted by external time-dependent fields. In specific cases of HI, the solution also shows a considerable quantum speedup in computations.

| S-EPMC9038765 | biostudies-literature

Experimental exploration of five-qubit quantum error-correcting code with superconducting qubits.

Project description:Quantum error correction is an essential ingredient for universal quantum computing. Despite tremendous experimental efforts in the study of quantum error correction, to date, there has been no demonstration in the realisation of universal quantum error-correcting code, with the subsequent verification of all key features including the identification of an arbitrary physical error, the capability for transversal manipulation of the logical state and state decoding. To address this challenge, we experimentally realise the [5, 1, 3] code, the so-called smallest perfect code that permits corrections of generic single-qubit errors. In the experiment, having optimised the encoding circuit, we employ an array of superconducting qubits to realise the [5, 1, 3] code for several typical logical states including the magic state, an indispensable resource for realising non-Clifford gates. The encoded states are prepared with an average fidelity of [Formula: see text] while with a high fidelity of [Formula: see text] in the code space. Then, the arbitrary single-qubit errors introduced manually are identified by measuring the stabilisers. We further implement logical Pauli operations with a fidelity of [Formula: see text] within the code space. Finally, we realise the decoding circuit and recover the input state with an overall fidelity of [Formula: see text], in total with 92 gates. Our work demonstrates each key aspect of the [5, 1, 3] code and verifies the viability of experimental realisation of quantum error-correcting codes with superconducting qubits.

| S-EPMC8776549 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data