Genetic algorithm-optimized dynamical decoupling sequences empirically outperform canonical DD sequences on IBM quantum processors for circuits up to 100 qubits, with gains increasing with size and complexity.
Better-than-Classical Grover S earch via Quantum Error Detection and Suppression
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Experimental runs of Grover's algorithm on IBM Heron QPUs show higher success rates for 3-5 qubits than prior generations, with further gains from topological dynamical decoupling on 5- and 6-qubit cases.
citing papers explorer
-
Empirical learning of dynamical decoupling on quantum processors
Genetic algorithm-optimized dynamical decoupling sequences empirically outperform canonical DD sequences on IBM quantum processors for circuits up to 100 qubits, with gains increasing with size and complexity.
-
Improvement of performance of Grover's algorithm on three generations of Heron family IBM QPUs without and with topological dynamical decoupling
Experimental runs of Grover's algorithm on IBM Heron QPUs show higher success rates for 3-5 qubits than prior generations, with further gains from topological dynamical decoupling on 5- and 6-qubit cases.