43,309 research outputs found
The largest eigenvalue of rank one deformation of large Wigner matrices
The purpose of this paper is to establish universality of the fluctuations of
the largest eigenvalue of some non necessarily Gaussian complex Deformed Wigner
Ensembles. The real model is also considered. Our approach is close to the one
used by A. Soshnikov in the investigations of classical real or complex Wigner
Ensembles. It is based on the computation of moments of traces of high powers
of the random matrices under consideration
Generation of Universal Linear Optics by Any Beamsplitter
In 1994, Reck et al. showed how to realize any unitary transformation on a
single photon using a product of beamsplitters and phaseshifters. Here we show
that any single beamsplitter that nontrivially mixes two modes, also densely
generates the set of unitary transformations (or orthogonal transformations, in
the real case) on the single-photon subspace with m>=3 modes. (We prove the
same result for any two-mode real optical gate, and for any two-mode optical
gate combined with a generic phaseshifter.) Experimentally, this means that one
does not need tunable beamsplitters or phaseshifters for universality: any
nontrivial beamsplitter is universal for linear optics. Theoretically, it means
that one cannot produce "intermediate" models of linear optical computation
(analogous to the Clifford group for qubits) by restricting the allowed
beamsplitters and phaseshifters: there is a dichotomy; one either gets a
trivial set or else a universal set. No similar classification theorem for
gates acting on qubits is currently known. We leave open the problem of
classifying optical gates that act on three or more modes.Comment: 14 pages; edited Lemma 3.3 and updated references. Results are
unchange
Determinism and Computational Power of Real Measurement-based Quantum Computation
International audienceMeasurement-based quantum computing (MBQC) is a universal model for quantum computation. The combinatorial characterisation of determinism in this model, powered by measurements, and hence, fundamentally probabilistic, is the cornerstone of most of the breakthrough results in this field. The most general known sufficient condition for a deterministic MBQC to be driven is that the underlying graph of the computation has a particular kind of flow called Pauli flow. The necessity of the Pauli flow was an open question. We show that the Pauli flow is necessary for real-MBQC, and not in general providing counterexamples for (complex) MBQC. We explore the consequences of this result for real MBQC and its applications. Real MBQC and more generally real quantum computing is known to be universal for quantum computing. Real MBQC has been used for interactive proofs by McKague. The two-prover case corresponds to real-MBQC on bipartite graphs. While (complex) MBQC on bipartite graphs are universal, the universality of real MBQC on bipartite graphs was an open question. We show that real bipartite MBQC is not universal proving that all measurements of real bipartite MBQC can be parallelised leading to constant depth computations. As a consequence, McKague techniques cannot lead to two-prover interactive proofs
Universality and programmability of quantum computers
Manin, Feynman, and Deutsch have viewed quantum computing as a kind of
universal physical simulation procedure. Much of the writing about quantum
logic circuits and quantum Turing machines has shown how these machines can
simulate an arbitrary unitary transformation on a finite number of qubits. The
problem of universality has been addressed most famously in a paper by Deutsch,
and later by Bernstein and Vazirani as well as Kitaev and Solovay. The quantum
logic circuit model, developed by Feynman and Deutsch, has been more prominent
in the research literature than Deutsch's quantum Turing machines. Quantum
Turing machines form a class closely related to deterministic and probabilistic
Turing machines and one might hope to find a universal machine in this class. A
universal machine is the basis of a notion of programmability. The extent to
which universality has in fact been established by the pioneers in the field is
examined and this key notion in theoretical computer science is scrutinised in
quantum computing by distinguishing various connotations and concomitant
results and problems.Comment: 17 pages, expands on arXiv:0705.3077v1 [quant-ph
Verification for Timed Automata extended with Unbounded Discrete Data Structures
We study decidability of verification problems for timed automata extended
with unbounded discrete data structures. More detailed, we extend timed
automata with a pushdown stack. In this way, we obtain a strong model that may
for instance be used to model real-time programs with procedure calls. It is
long known that the reachability problem for this model is decidable. The goal
of this paper is to identify subclasses of timed pushdown automata for which
the language inclusion problem and related problems are decidable
- …