DPG Phi
Verhandlungen
Verhandlungen
DPG

Erlangen 2018 – wissenschaftliches Programm

Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe

Q: Fachverband Quantenoptik und Photonik

Q 46: Quantum Information (Concepts and Methods) IV

Q 46.7: Vortrag

Mittwoch, 7. März 2018, 15:30–15:45, K 1.019

Recovery of quantum gates from few average gate fidelities — •Ingo Roth1, Richard Kueng2, Shelby Kimmel3, Yi-Kai Liu4, Jens Eisert1, and Martin Kliesch51FU Berlin, Germany — 2CalTech, USA — 3Middlebury College, USA — 4NIST, Gaithersburg, USA — 5University of Gdańsk, Poland

One of the core tasks in quantum information science is the characterisation of quantum processes. But achieving this characterisation efficiently and accurately is a challenge. In this work, we consider using data from average gate fidelities to characterize quantum gates. Average gate fidelities are relatively easy to learn, and in some cases have additional robustness to state preparation and measurement errors. We show that any unital quantum channel can be affinely expanded in terms of any given unitary 2-design with coefficients determined by the average gate fidelities. Therefore O(d4) average gate fidelities allow to uniquely determine a unital quantum channel acting on a d-dimenisonal Hilbert space. For the important case of characterizing multi-qubit unitary gates, we can further reduce this number to O(d2 log(d)) average fidelities measured with respect to random Clifford gates, which are natural for many experiments. As a side result, we also obtain a novel statistical interpretation of the unitarity – a figure of merit that characterises the coherence of a noise process.

In our proofs we exploit new representation theoretic insights on the Clifford group, develop a version of Collins’ calculus with Weingarten functions for integration over the Clifford group, and combine this with proof techniques from compressed sensing.

100% | Mobil-Ansicht | English Version | Kontakt/Impressum/Datenschutz
DPG-Physik > DPG-Verhandlungen > 2018 > Erlangen