A survey on the complexity of learning quantum states

A Anshu, S Arunachalam - Nature Reviews Physics, 2024 - nature.com
Quantum learning theory is a new and very active area of research at the intersection of
quantum computing and machine learning. Important breakthroughs in the past two years …

Quantum algorithms for algebraic problems

AM Childs, W Van Dam - Reviews of Modern Physics, 2010 - APS
Quantum computers can execute algorithms that dramatically outperform classical
computation. As the best-known example, Shor discovered an efficient quantum algorithm …

Quantum algorithmic measurement

D Aharonov, J Cotler, XL Qi - Nature communications, 2022 - nature.com
There has been recent promising experimental and theoretical evidence that quantum
computational tools might enhance the precision and efficiency of physical experiments …

Quantum algorithm for Petz recovery channels and pretty good measurements

A Gilyén, S Lloyd, I Marvian, Y Quek, MM Wilde - Physical Review Letters, 2022 - APS
The Petz recovery channel plays an important role in quantum information science as an
operation that approximately reverses the effect of a quantum channel. The pretty good …

Optimal quantum sample complexity of learning algorithms

S Arunachalam, R De Wolf - Journal of Machine Learning Research, 2018 - jmlr.org
In learning theory, the VC dimension of a concept class ℒ is the most common way to
measure its" richness." A fundamental result says that the number of examples needed to …

Optimal algorithms for learning quantum phase states

S Arunachalam, S Bravyi, A Dutt, TJ Yoder - arxiv preprint arxiv …, 2022 - arxiv.org
We analyze the complexity of learning $ n $-qubit quantum phase states. A degree-$ d $
phase state is defined as a superposition of all $2^ n $ basis vectors $ x $ with amplitudes …

Quantum algorithm design: techniques and applications

C Shao, Y Li, H Li - Journal of Systems Science and Complexity, 2019 - Springer
In recent years, rapid developments of quantum computer are witnessed in both the
hardware and the algorithm domains, making it necessary to have an updated review of …

On the optimal error exponents for classical and quantum antidistinguishability

HK Mishra, M Nussbaum, MM Wilde - Letters in Mathematical Physics, 2024 - Springer
The concept of antidistinguishability of quantum states has been studied to investigate
foundational questions in quantum mechanics. It is also called quantum state elimination …

From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups

D Bacon, AM Childs, W van Dam - 46th Annual IEEE …, 2005 - ieeexplore.ieee.org
We approach the hidden subgroup problem by performing the so-called pretty good
measurement on hidden subgroup states. For various groups that can be expressed as the …

Limitations of quantum coset states for graph isomorphism

S Hallgren, C Moore, M Rötteler, A Russell… - Journal of the ACM …, 2010 - dl.acm.org
It has been known for some time that graph isomorphism reduces to the hidden subgroup
problem (HSP). What is more, most exponential speedups in quantum computation are …