1,121 research outputs found

    Construction and testing of the optical bench for LISA pathfinder

    Get PDF
    eLISA is a space mission designed to measure gravitational radiation over a frequency range of 0.1–100 mHz (European Space Agency LISA Assessment Study Report 2011). It uses laser interferometry to measure changes of order 10pm/Hz10\,{\rm pm /\sqrt{Hz}} in the separation of inertial test masses housed in spacecraft separated by 1 million km. LISA Pathfinder (LPF) is a technology demonstrator mission that will test the key eLISA technologies of inertial test masses monitored by laser interferometry in a drag-free spacecraft. The optical bench that provides the interferometry for LPF must meet a number of stringent requirements: the optical path must be stable at the few pm/Hz{\rm pm /\sqrt{Hz}} level; it must direct the optical beams onto the inertial masses with an accuracy of better than ±25 μm, and it must be robust enough not only to survive launch vibrations but to achieve full performance after launch. In this paper we describe the construction and testing of the flight optical bench for LISA Pathfinder that meets all the design requirements

    Cross-verification of independent quantum devices

    Get PDF
    Quantum computers are on the brink of surpassing the capabilities of even the most powerful classical computers. This naturally raises the question of how one can trust the results of a quantum computer when they cannot be compared to classical simulation. Here we present a verification technique that exploits the principles of measurement-based quantum computation to link quantum circuits of different input size, depth, and structure. Our approach enables consistency checks of quantum computations within a device, as well as between independent devices. We showcase our protocol by applying it to five state-of-the-art quantum processors, based on four distinct physical architectures: nuclear magnetic resonance, superconducting circuits, trapped ions, and photonics, with up to 6 qubits and 200 distinct circuits

    Framing the private land conservation conversation: Strategic framing of the benefits of conservation participation could increase landholder engagement

    Get PDF
    How conservation messages are framed will likely impact on the success of our efforts to engage people in conservation action. This is highly relevant in the private land conservation (PLC) sector given the low participation rates of landholders. Using a case study of PLC schemes targeted at Australian landholders, we present the first systematic analysis of communication strategies used by organisations and government departments delivering those schemes to engage the public. We develop a novel approach for analysing the framing of conservation messages that codes the stated benefits of schemes according to value orientation. We categorised the benefits as flowing to either the landholder, to society, or to the environment, corresponding to the egoistic, altruistic and biospheric value orientations that have been shown to influence human behaviour. We find that messages are biased towards environmental benefits. Surprisingly, this is the case even for market-based schemes that have the explicit objective of appealing to production-focussed landholders and those who are not already involved in conservation. The risk is that PLC schemes framed in this way will fail to engage more egoistically oriented landholders and are only likely to appeal to those most likely to already be conservation-minded. By understanding the frame in which PLC benefits are communicated, we can begin to understand the types of people who may be engaged by these messages, and who may not be. Results suggest that the framing of the communications for many schemes could be broadened to appeal to a more diverse group (and thus ultimately to a larger group) of landholders

    Isomyosins in human type 1 and type 2 skeletal muscle fibres

    Full text link

    Unconditionally verifiable blind computation

    Get PDF
    Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can verify with high probability whether the server has followed the instructions of the protocol, or if there has been some deviation resulting in a corrupted output state. A verifiable BQC protocol can be viewed as an interactive proof system leading to consequences for complexity theory. The authors, together with Broadbent, previously proposed a universal and unconditionally secure BQC scheme where the client only needs to be able to prepare single qubits in separable states randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. In this paper we extend that protocol with new functionality allowing blind computational basis measurements, which we use to construct a new verifiable BQC protocol based on a new class of resource states. We rigorously prove that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter. The new resource state allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead. This is a significant improvement on the original scheme, which required that all computations to be performed must first be put into a nearest neighbour form, incurring linear overhead in the number of qubits. Such an improvement has important consequences for efficiency and fault-tolerance thresholds.Comment: 46 pages, 10 figures. Additional protocol added which allows arbitrary circuits to be verified with polynomial securit

    A co-production approach guided by the behaviour change wheel to develop an intervention for reducing sedentary behaviour after stroke

    Get PDF
    Background Stroke survivors are highly sedentary; thus, breaking up long uninterrupted bouts of sedentary behaviour could have substantial health benefit. However, there are no intervention strategies specifically aimed at reducing sedentary behaviour tailored for stroke survivors. The purpose of this study was to use co-production approaches to develop an intervention to reduce sedentary behaviour after stroke. Methods A series of five co-production workshops with stroke survivors, their caregivers, stroke service staff, exercise professionals, and researchers were conducted in parallel in two-stroke services (England and Scotland). Workshop format was informed by the behaviour change wheel (BCW) framework for developing interventions and incorporated systematic review and empirical evidence. Taking an iterative approach, data from activities and audio recordings were analysed following each workshop and findings used to inform subsequent workshops, to inform both the activities of the next workshop and ongoing intervention development. Findings Co-production workshop participants (n = 43) included 17 staff, 14 stroke survivors, six caregivers and six researchers. The target behaviour for stroke survivors is to increase standing and moving, and the target behaviour for caregivers and staff is to support and encourage stroke survivors to increase standing and moving. The developed intervention is primarily based on co-produced solutions to barriers to achieving the target behaviour. The developed intervention includes 34 behaviour change techniques. The intervention is to be delivered through stroke services, commencing in the inpatient setting and following through discharge into the community. Participants reported that taking part in intervention development was a positive experience. Conclusions To our knowledge, this is the first study that has combined the use of co-production and the BCW to develop an intervention for use in stroke care. In-depth reporting of how a co-production approach was combined with the BCW framework, including the design of bespoke materials for workshop activities, should prove useful to other researchers and practitioners involved in intervention development in stroke

    Sitting as a moral practice: older adults’ accounts from qualitative interviews on sedentary behaviours

    Get PDF
    Amidst public health campaigns urging people to sit less as well as being more physically active, this paper investigates how older adults make sense of their sedentary behaviour. Using an accounts framework focusing on how people rationalise their sitting practices, we analysed data from 44 qualitative interviews with older adults. All interviewees had received information about sedentary behaviour and health, visual feedback on their own objectively measured sitting over a week and guidance on sitting less. Participants used accounts to position sitting as a moral practice, distinguishing between ‘good’ (active/‘busy’) and ‘bad’ (passive/‘not busy’) sitting. This allowed them to align themselves with acceptable (worthwhile) forms of sitting and distance themselves from other people whose sitting they viewed as less worthwhile. However, some participants also described needing to sit more as they got older. The findings suggest that some public health messaging may lead to stigmatisation around sitting. Future sedentary behaviour guidelines and public health campaigns should consider more relatable guidelines that consider the lived realities of ageing, and the individual and social factors that shape them. They should advocate finding a balance between sitting and moving that is appropriate for each person

    Fast graph operations in quantum computation

    Get PDF
    The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in the reverse direction to yield a graph data structure, which allows for more efficient manipulation and comparison of graphs than any possible classical structure. We introduce efficient algorithms for many transformation and comparison operations on graphs represented as graph states, and prove that no classical data structure can have similar performance for the full set of operations studied
    corecore