870 research outputs found
Measurement in Quantum Physics
The conceptual problems in quantum mechanics -- related to the collapse of
the wave function, the particle-wave duality, the meaning of measurement --
arise from the need to ascribe particle character to the wave function. As will
be shown, all these problems dissolve when working instead with quantum fields,
which have both wave and particle character. Otherwise the predictions of
quantum physics, including Bell's inequalities, coincide with those of the
standard treatments. The transfer of the results of the quantum measurement to
the classical realm is also discussed.Comment: 34 pages, in Latex, revised and expanded version with an extra
appendix on decoherenc
Which graph states are useful for quantum information processing?
Graph states are an elegant and powerful quantum resource for measurement
based quantum computation (MBQC). They are also used for many quantum protocols
(error correction, secret sharing, etc.). The main focus of this paper is to
provide a structural characterisation of the graph states that can be used for
quantum information processing. The existence of a gflow (generalized flow) is
known to be a requirement for open graphs (graph, input set and output set) to
perform uniformly and strongly deterministic computations. We weaken the gflow
conditions to define two new more general kinds of MBQC: uniform
equiprobability and constant probability. These classes can be useful from a
cryptographic and information point of view because even though we cannot do a
deterministic computation in general we can preserve the information and
transfer it perfectly from the inputs to the outputs. We derive simple graph
characterisations for these classes and prove that the deterministic and
uniform equiprobability classes collapse when the cardinalities of inputs and
outputs are the same. We also prove the reversibility of gflow in that case.
The new graphical characterisations allow us to go from open graphs to graphs
in general and to consider this question: given a graph with no inputs or
outputs fixed, which vertices can be chosen as input and output for quantum
information processing? We present a characterisation of the sets of possible
inputs and ouputs for the equiprobability class, which is also valid for
deterministic computations with inputs and ouputs of the same cardinality.Comment: 13 pages, 2 figure
Reversing Single Sessions
Session-based communication has gained a widespread acceptance in practice as
a means for developing safe communicating systems via structured interactions.
In this paper, we investigate how these structured interactions are affected by
reversibility, which provides a computational model allowing executed
interactions to be undone. In particular, we provide a systematic study of the
integration of different notions of reversibility in both binary and multiparty
single sessions. The considered forms of reversibility are: one for completely
reversing a given session with one backward step, and another for also
restoring any intermediate state of the session with either one backward step
or multiple ones. We analyse the costs of reversing a session in all these
different settings. Our results show that extending binary single sessions to
multiparty ones does not affect the reversibility machinery and its costs
Determinism in the one-way model
We introduce a flow condition on open graph states (graph states with inputs
and outputs) which guarantees globally deterministic behavior of a class of
measurement patterns defined over them. Dependent Pauli corrections are derived
for all such patterns, which equalize all computation branches, and only depend
on the underlying entanglement graph and its choice of inputs and outputs.
The class of patterns having flow is stable under composition and
tensorization, and has unitary embeddings as realizations. The restricted class
of patterns having both flow and reverse flow, supports an operation of
adjunction, and has all and only unitaries as realizations.Comment: 8 figures, keywords: measurement based quantum computing,
deterministic computing; Published version, including a new section on
circuit decompositio
Reversibility in the Extended Measurement-based Quantum Computation
When applied on some particular quantum entangled states, measurements are
universal for quantum computing. In particular, despite the fondamental
probabilistic evolution of quantum measurements, any unitary evolution can be
simulated by a measurement-based quantum computer (MBQC). We consider the
extended version of the MBQC where each measurement can occur not only in the
(X,Y)-plane of the Bloch sphere but also in the (X,Z)- and (Y,Z)-planes. The
existence of a gflow in the underlying graph of the computation is a necessary
and sufficient condition for a certain kind of determinism. We extend the
focused gflow (a gflow in a particular normal form) defined for the (X,Y)-plane
to the extended case, and we provide necessary and sufficient conditions for
the existence of such normal forms
A Signature of Cosmic Strings Wakes in the CMB Polarization
We calculate a signature of cosmic strings in the polarization of the cosmic
microwave background (CMB). We find that ionization in the wakes behind moving
strings gives rise to extra polarization in a set of rectangular patches in the
sky whose length distribution is scale-invariant. The length of an individual
patch is set by the co-moving Hubble radius at the time the string is
perturbing the CMB. The polarization signal is largest for string wakes
produced at the earliest post-recombination time, and for an alignment in which
the photons cross the wake close to the time the wake is created. The maximal
amplitude of the polarization relative to the temperature quadrupole is set by
the overdensity of free electrons inside a wake which depends on the ionization
fraction inside the wake. The signal can be as high as
in degree scale polarization for a string at high redshift (near recombination)
and a string tension given by .Comment: 8 pages, 3 figure
Distribution-based bisimulation for labelled Markov processes
In this paper we propose a (sub)distribution-based bisimulation for labelled
Markov processes and compare it with earlier definitions of state and event
bisimulation, which both only compare states. In contrast to those state-based
bisimulations, our distribution bisimulation is weaker, but corresponds more
closely to linear properties. We construct a logic and a metric to describe our
distribution bisimulation and discuss linearity, continuity and compositional
properties.Comment: Accepted by FORMATS 201
Batalin-Vilkovisky Integrals in Finite Dimensions
The Batalin-Vilkovisky method (BV) is the most powerful method to analyze
functional integrals with (infinite-dimensional) gauge symmetries presently
known. It has been invented to fix gauges associated with symmetries that do
not close off-shell. Homological Perturbation Theory is introduced and used to
develop the integration theory behind BV and to describe the BV quantization of
a Lagrangian system with symmetries. Localization (illustrated in terms of
Duistermaat-Heckman localization) as well as anomalous symmetries are discussed
in the framework of BV.Comment: 35 page
Time evolution and decoherence of a spin-1/2 particle coupled to a spin bath in thermal equilibrium
The time evolution of a spin-1/2 particle under the influence of a locally
applied external magnetic field, and interacting with anisotropic spin
environment in thermal equilibrium at temperature is studied. The exact
analytical form of the reduced density matrix of the central spin is calculated
explicitly for finite number of bath spins. The case of an infinite number of
environmental spins is investigated using the convergence of the rescaled bath
operators to normal Gaussian random variables. In this limit, we derive the
analytical form of the components of the Bloch vector for antiferromagnetic
interactions within the bath, and we investigate the short-time and long-time
behavior of reduced dynamics. The effect of the external magnetic field, the
anisotropy and the temperature of the bath on the decoherence of the central
spin is discussed.Comment: 17 pages, 13 figures (compressed), one table. To appear in Phys. Rev.
On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control
International audienceWe construct a partially-ordered hierarchy of delimited control operators similar to those of the CPS hierarchy of Danvy and Filinski. However, instead of relying on nested CPS translations, these operators are directly interpreted in linear logic extended with subexponentials (i.e., multiple pairs of ! and ?). We construct an independent proof theory for a fragment of this logic based on the principle of focusing. It is then shown that the new constraints placed on the permutation of cuts correspond to multiple levels of delimited control
- …