Quantum Property Testing for Solvable Groups
Yoshifumi Inui
Abstract
Property testing has been extensively studied and its target is to determine whether a given object satisfies a certain property or it is far from the property. In this paper, we construct an efficient quantum algorithm which tests if a given quantum oracle performs the group multiplication of a solvable group. Our work is strongly based on the efficient classical testing algorithm for Abelian groups proposed by Friedl, Ivanyos and Santha. Since every Abelian group is a solvable group, our result is in a sense a generalization of their result.
Create a lesson
Related papers
Towards unsupervised representation learning for quantum data: quantum models with inference and generation
Robin Lorenz, Eric Brunner, Marcello Benedetti
Spatial correlations of photons interacting via transverse Rydberg blockade
Bankim Chandra Das, Daniil Svirskiy, Matthias Metternich et al.
Generation of multicomponent Schrödinger cat states in schemes with measurement of Gaussian states
E. A. Nesterova, S. B. Korolev
Which Otto Engine Is the Fastest?
Idriss Hank Nkouatchoua Ngueya, Marcin Łobejko
Optimization Landscape Geometry in VQE for Frustrated Quantum Spin Models
Vojtěch Novák, Ivan Zelinka, Swagatam Das et al.
Codes for Quantum Secret Sharing with a Helper
Eric Chitambar, Sarah Hagen, David W. Kribs et al.