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.
MIT press, 2022
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
Quantum probes with squeezing or entanglement, routed via an identifiability-guaranteeing algorithm, enable improved estimation of link transmissivities in general optical networks using det(FIM) and tr(FIM^{-1}) metrics.
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.
-
Quantum-enhanced Network Tomography
Quantum probes with squeezing or entanglement, routed via an identifiability-guaranteeing algorithm, enable improved estimation of link transmissivities in general optical networks using det(FIM) and tr(FIM^{-1}) metrics.