4 papers · 1 filter
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…
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…
Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation
Elijah Pelofske, Vincent Russo, Ryan LaRose +5
Quantum Volume is a full-stack benchmark for near-term quantum computers. It quantifies the largest size of a square circuit which can be executed on the target device with reasona…
Probing Quantum Telecloning on Superconducting Quantum Processors
Elijah Pelofske, Andreas Bärtschi, Stephan Eidenbenz +2
Quantum information can not be perfectly cloned, but approximate copies of quantum information can be generated. Quantum telecloning combines approximate quantum cloning, more typi…