Dresden 2017 – scientific programme
Parts | Days | Selection | Search | Updates | Downloads | Help
HL: Fachverband Halbleiterphysik
HL 29: Transport: Quantum Coherence and Quantum Information Systems - Theory (jointly with MA, HL)
HL 29.4: Talk
Tuesday, March 21, 2017, 10:15–10:30, HSZ 103
Symmetry Benchmarking of Quantum Algorithms — •Tobias Chasseur Chasseur1, Felix Motzoi1,2, Michael Kaicher1, Pierre-Luc Dallaire-Demers1, and Frank Wilhelm1 — 1Theoretical Physics, Saarland University, 66123 Saarbrücken, Germany — 2Department of Physics and Astronomy, Aarhus University, 8000 Aarhus C, Denmark
Scalable and robust benchmarking of quantum gates is essential on the path to a useful quantum computer, as current candidates such as superconducting qubit systems are set to leave the few qubit regime in the near future. Randomized Benchmarking and related approaches provide solutions for specific gates such as the Clifford group or a limited number of qubits; however a tool for benchmarking arbitrary gates without exponential scaling in the number of qubits seems prohibited by the inherent power of quantum computation. In this work we present a symmetry benchmarking protocol to estimate the implementation fidelity of specific algorithms with polynomial scaling. The proposed protocol relies on unitary 1-designs on the eigenspaces of algorithm-specific preserved quantities, as well as sequence structures similar to Randomized Benchmarking. It benchmarks the symmetry preservation of the implementation as an indicator for the overall fidelity. We demonstrate the protocol for the specific example of algorithms consisting of number preserving gates.