2 papers
quant-ph2025
Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
Naphan Benchasattabuse, Andreas Bärtschi, Luis Pedro GarcÃa-Pintos +3
The quantum approximate optimization algorithm, also known in its generalization as the quantum alternating operator ansatz, (QAOA) is a heuristic hybrid quantum-classical algorith…
quant-ph2025
Scalable Experimental Bounds for Entangled Quantum State Fidelities
Shamminuj Aktar, Andreas Bärtschi, Abdel-Hameed A. Badawy +1
Estimating the state preparation fidelity of highly entangled states on noisy intermediate-scale quantum (NISQ) devices is important for benchmarking and application considerations…