88,477 research outputs found
Determinant Formulae for some Tiling Problems and Application to Fully Packed Loops
We present determinant formulae for the number of tilings of various domains
in relation with Alternating Sign Matrix and Fully Packed Loop enumeration
Electronic dummy for acoustical testing
Electronic Dummy /ED/ used for acoustical testing represents the average male torso from the Xiphoid process upward and includes an acoustic replica of the human head. This head simulates natural flesh, and has an artificial voice and artificial ears that measure sound pressures at the eardrum or the entrance to the ear canal
Proposal for reading out anyon qubits in non-abelian quantum Hall state
To detect non-abelian statistics in the quantum Hall state
through interferometry, we apply an analysis similar to the ones proposed for
the non-abelian quantum Hall state. The result is that the
amplitude of the Aharonov-Bohm oscillation of this interference is dependent on
the internal states of quasiholes, but, in contrast to the quantum
Hall state, independent of the number of quasiholes. However, if the quasiholes
are in a superposition state, it is necessary for the interferometer to have
certain additional features to obtain the coefficients.Comment: 16 pages, 2 figures, Latex. Reference added, some errors corrected,
some content changed, some changes in the abstrac
Experimental Realization of a One-way Quantum Computer Algorithm Solving Simon's Problem
We report an experimental demonstration of a one-way implementation of a
quantum algorithm solving Simon's Problem - a black box period-finding problem
which has an exponential gap between the classical and quantum runtime. Using
an all-optical setup and modifying the bases of single-qubit measurements on a
five-qubit cluster state, key representative functions of the logical two-qubit
version's black box can be queried and solved. To the best of our knowledge,
this work represents the first experimental realization of the quantum
algorithm solving Simon's Problem. The experimental results are in excellent
agreement with the theoretical model, demonstrating the successful performance
of the algorithm. With a view to scaling up to larger numbers of qubits, we
analyze the resource requirements for an n-qubit version. This work helps
highlight how one-way quantum computing provides a practical route to
experimentally investigating the quantum-classical gap in the query complexity
model.Comment: 9 pages, 5 figure
An Algorithmic Approach to Quantum Field Theory
The lattice formulation provides a way to regularize, define and compute the
Path Integral in a Quantum Field Theory. In this paper we review the
theoretical foundations and the most basic algorithms required to implement a
typical lattice computation, including the Metropolis, the Gibbs sampling, the
Minimal Residual, and the Stabilized Biconjugate inverters. The main emphasis
is on gauge theories with fermions such as QCD. We also provide examples of
typical results from lattice QCD computations for quantities of
phenomenological interest.Comment: 44 pages, to be published in IJMP
A Bijection between classes of Fully Packed Loops and Plane Partitions
It has recently been observed empirically that the number of FPL
configurations with 3 sets of a, b and c nested arches equals the number of
plane partitions in a box of size a x b x c. In this note, this result is
proved by constructing explicitly the bijection between these FPL and plane
partitions
- …