Dagstuhl Seminar Proceedings, Volume 6391
Dagstuhl Seminar Proceedings
DagSemProc
https://www.dagstuhl.de/dagpub/1862-4405
https://dblp.org/db/series/dagstuhl
1862-4405
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
6391
2007
https://drops.dagstuhl.de/entities/volume/DagSemProc-volume-6391
06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems
From 24.09.06 to 29.09.06, the Dagstuhl Seminar 06391 ``Algorithms and Complexity for Continuous Problems'' was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar
are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
Computational complexity
partial information
high-dimensional problems
operator equations
non-linear approximation
quantum computation
stochastic computation
ill posed-problems
1-21
Regular Paper
Stephan
Dahlke
Stephan Dahlke
Klaus
Ritter
Klaus Ritter
Ian H.
Sloan
Ian H. Sloan
Joseph F.
Traub
Joseph F. Traub
10.4230/DagSemProc.06391.1
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode
Real Computational Universality: The Word Problem for a class of groups with infinite presentation
In this talk we introduce a class of groups represented as quotient groups
of some free groups generated by infinitely many elements and certain normal
subgroups. We show that the related word problem is universal in the Blum-Shub-Smale model
of computation, i.e. it has the same difficulty as the real Halting Problem.
This is the first natural example of a problem with this property.
The work has been done jointly with Martin Ziegler.
Computational group theory
word problem
Blum-Shub-Smale model
1-20
Regular Paper
Klaus
Meer
Klaus Meer
Martin
Ziegler
Martin Ziegler
10.4230/DagSemProc.06391.2
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query
complexity of computing a function of an unknown classical ``black box''
function
drawn from some set of such black box functions,
we investigate a more general quantum query model in which
the goal is to compute
functions of $N imes N$ ``black box'' unitary matrices drawn from
a set of such matrices, a problem with
applications to determining properties of quantum physical systems.
We characterize the existence of an algorithm for such a query problem,
with given query and error, as equivalent to the feasibility of a certain set of semidefinite
programming constraints, or equivalently the infeasibility of a dual of these
constraints, which we construct. Relaxing the primal constraints to correspond
to mere pairwise near-orthogonality of the final states of a quantum computer, conditional
on the various black-box inputs, rather than bounded-error distinguishability,
we obtain a relaxed primal program the feasibility of
whose dual still implies the nonexistence of a quantum algorithm. We use this to obtain
a generalization, to our not-necessarily-commutative setting,
of the ``spectral adversary method'' for quantum query lower bounds.
Quantum query complexity semidefinite programming
1-25
Regular Paper
Howard
Barnum
Howard Barnum
10.4230/DagSemProc.06391.3
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode