3,379 research outputs found
Parallel-propagating Fluctuations at Proton-kinetic Scales in the Solar Wind are Dominated by Kinetic Instabilities
We use magnetic helicity to characterise solar wind fluctuations at
proton-kinetic scales from Wind observations. For the first time, we separate
the contributions to helicity from fluctuations propagating at angles
quasi-parallel and oblique to the local mean magnetic field, . We
find that the helicity of quasi-parallel fluctuations is consistent with
Alfv\'en-ion cyclotron and fast magnetosonic-whistler modes driven by proton
temperature anisotropy instabilities and the presence of a relative drift
between -particles and protons. We also find that the helicity of
oblique fluctuations has little dependence on proton temperature anisotropy and
is consistent with fluctuations from the anisotropic turbulent cascade. Our
results show that parallel-propagating fluctuations at proton-kinetic scales in
the solar wind are dominated by proton temperature anisotropy instabilities and
not the turbulent cascade. We also provide evidence that the behaviour of
fluctuations at these scales is independent of the origin and macroscopic
properties of the solar wind.Comment: Accepted for publication in ApJL. 6 Pages, 3 figures, 1 tabl
A classical analogue of entanglement
We show that quantum entanglement has a very close classical analogue, namely
secret classical correlations. The fundamental analogy stems from the behavior
of quantum entanglement under local operations and classical communication and
the behavior of secret correlations under local operations and public
communication. A large number of derived analogies follow. In particular
teleportation is analogous to the one-time-pad, the concept of ``pure state''
exists in the classical domain, entanglement concentration and dilution are
essentially classical secrecy protocols, and single copy entanglement
manipulations have such a close classical analog that the majorization results
are reproduced in the classical setting. This analogy allows one to import
questions from the quantum domain into the classical one, and vice-versa,
helping to get a better understanding of both. Also, by identifying classical
aspects of quantum entanglement it allows one to identify those aspects of
entanglement which are uniquely quantum mechanical.Comment: 13 pages, references update
How does HCI Understand Human Autonomy and Agency?
Funding Information: Funded by the European Union (ERC, THEORYCRAFT, 101043198). Publisher Copyright: © 2023 Owner/Author.Human agency and autonomy have always been fundamental concepts in HCI. New developments, including ubiquitous AI and the growing integration of technologies into our lives, make these issues ever pressing, as technologies increase their ability to influence our behaviours and values. However, in HCI understandings of autonomy and agency remain ambiguous. Both concepts are used to describe a wide range of phenomena pertaining to sense-of-control, material independence, and identity. It is unclear to what degree these understandings are compatible, and how they support the development of research programs and practical interventions. We address this by reviewing 30 years of HCI research on autonomy and agency to identify current understandings, open issues, and future directions. From this analysis, we identify ethical issues, and outline key themes to guide future work. We also articulate avenues for advancing clarity and specificity around these concepts, and for coordinating integrative work across different HCI communities.Peer reviewe
Domesticating Australian Native Legumes for Pastures: A Case Study in \u3ci\u3eCullen\u3c/i\u3e
Quantum Teleportation is a Universal Computational Primitive
We present a method to create a variety of interesting gates by teleporting
quantum bits through special entangled states. This allows, for instance, the
construction of a quantum computer based on just single qubit operations, Bell
measurements, and GHZ states. We also present straightforward constructions of
a wide variety of fault-tolerant quantum gates.Comment: 6 pages, REVTeX, 6 epsf figure
Practical private database queries based on a quantum key distribution protocol
Private queries allow a user Alice to learn an element of a database held by
a provider Bob without revealing which element she was interested in, while
limiting her information about the other elements. We propose to implement
private queries based on a quantum key distribution protocol, with changes only
in the classical post-processing of the key. This approach makes our scheme
both easy to implement and loss-tolerant. While unconditionally secure private
queries are known to be impossible, we argue that an interesting degree of
security can be achieved, relying on fundamental physical principles instead of
unverifiable security assumptions in order to protect both user and database.
We think that there is scope for such practical private queries to become
another remarkable application of quantum information in the footsteps of
quantum key distribution.Comment: 7 pages, 2 figures, new and improved version, clarified claims,
expanded security discussio
A Theory of Fault-Tolerant Quantum Computation
In order to use quantum error-correcting codes to actually improve the
performance of a quantum computer, it is necessary to be able to perform
operations fault-tolerantly on encoded states. I present a general theory of
fault-tolerant operations based on symmetries of the code stabilizer. This
allows a straightforward determination of which operations can be performed
fault-tolerantly on a given code. I demonstrate that fault-tolerant universal
computation is possible for any stabilizer code. I discuss a number of examples
in more detail, including the five-qubit code.Comment: 30 pages, REVTeX, universal swapping operation added to allow
universal computation on any stabilizer cod
How to share a quantum secret
We investigate the concept of quantum secret sharing. In a ((k,n)) threshold
scheme, a secret quantum state is divided into n shares such that any k of
those shares can be used to reconstruct the secret, but any set of k-1 or fewer
shares contains absolutely no information about the secret. We show that the
only constraint on the existence of threshold schemes comes from the quantum
"no-cloning theorem", which requires that n < 2k, and, in all such cases, we
give an efficient construction of a ((k,n)) threshold scheme. We also explore
similarities and differences between quantum secret sharing schemes and quantum
error-correcting codes. One remarkable difference is that, while most existing
quantum codes encode pure states as pure states, quantum secret sharing schemes
must use mixed states in some cases. For example, if k <= n < 2k-1 then any
((k,n)) threshold scheme must distribute information that is globally in a
mixed state.Comment: 5 pages, REVTeX, submitted to PR
- …