Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm

• Present-day, noisy, small or intermediate-scale quantum processors-although far from fault tolerant-support the execution of heuristic quantum algorithms, which might enable a quantum advantage, for example, when applied to combinatorial optimization problems. On small-scale quantum processors, validations of such algorithms serve as important technology demonstrators. We implement the quantum approximate optimization algorithm on our hardware platform, consisting of two superconducting transmon qubits and one parametrically modulated coupler. We solve small instances of the NP (nondeterministic polynomial time)-complete exact-cover problem, with 96.6% success probability, by iterating the algorithm up to level two.

Ämnesord

NATURVETENSKAP  -- Fysik -- Annan fysik (hsv//swe)

NATURAL SCIENCES  -- Physical Sciences -- Other Physics Topics (hsv//eng)

NATURVETENSKAP  -- Matematik -- Diskret matematik (hsv//swe)

NATURAL SCIENCES  -- Mathematics -- Discrete Mathematics (hsv//eng)

NATURVETENSKAP  -- Fysik -- Den kondenserade materiens fysik (hsv//swe)

NATURAL SCIENCES  -- Physical Sciences -- Condensed Matter Physics (hsv//eng)

Publikations- och innehållstyp

art (ämneskategori)

ref (ämneskategori)