Graph sparsification and decomposition reduce worst-case H_Ising pulses from O(n²) to O(n log(n/ε)) and Pauli-X flips from O(n²) to O(n log(n/ε)/ε²) for (1-ε) Max-Cut approximation in trapped-ion QAOA compilations.
Expectation values from the single- layer quantum approximate optimization algorithm on ising problems.Quantum Science and Technology, 7(4):045036
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations
Graph sparsification and decomposition reduce worst-case H_Ising pulses from O(n²) to O(n log(n/ε)) and Pauli-X flips from O(n²) to O(n log(n/ε)/ε²) for (1-ε) Max-Cut approximation in trapped-ion QAOA compilations.