Pragya Shukla, Indian Institute of Technology Kharagpur
Jonathan Friedman, Amherst College
David Gosset, Institute for Quantum Computing (IQC)
Melanie Jensenworth, University of Washington
A welded tree is a graph consisting of two binary trees "welded"
together with a random cycle between the leaves. In 2003, Childs et
al. showed that a quantum walk has an exponential speedup over
classical algorithms when traversing the graph from one root vertex to
the other. I give evidence that related graphs also have an
exponential gap between classical algorithms and the quantum walk.
Vadym Kliuchnikov, Institute for Quantum Computing (IQC)
TBD
Guoxing Miao, Institute for Quantum Computing (IQC)
Caslav Brukner, Institute for Quantum Computing (IQC)
Barbara Terhal, RWTH Aachen University
Audrey Dot, Joseph Fourier University
Quantum theory is inherently statistical. This entails repetition of experiments over a number of identically prepared quantum objects, if one wants to know the "true state" or the "true value" of the parameter that specifies the quantum state. In applications, one needs to design the estimation procedure in such a way that the estimated value of the parameter should be close to the true value (consistency), and that the uncertainty of the estimated value should be as small as possible (efficiency).