Micro-simulating child poverty in 2010 and 2020

The 2008 Pre-Budget Report (PBR) said that 'the Government will take stock of progress towards its 2010 and 2020 child poverty target in the [2009] Budget'. As background to that exercise, this paper updates our previous analysis of the prospects for child poverty in the UK in 2010-11 and 2020-21

Loss tolerant linear optical quantum memory by measurement-based quantum computing

We give a scheme for loss tolerantly building a linear optical quantum memory which itself is tolerant to qubit loss. We use the encoding recently introduced in Varnava et al 2006 Phys. Rev. Lett. 97 120501, and give a method for efficiently achieving this. The entire approach resides within the 'one-way' model for quantum computing (Raussendorf and Briegel 2001 Phys. Rev. Lett. 86 5188–91; Raussendorf et al 2003 Phys. Rev. A 68 022312). Our results suggest that it is possible to build a loss tolerant quantum memory, such that if the requirement is to keep the data stored over arbitrarily long times then this is possible with only polynomially increasing resources and logarithmically increasing individual photon life-times

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

Project for the analysis of technology transfer Quarterly report, 13 Jul. - 12 Oct. 1968

Statistical characteristics of transfer data bank users, and outline of technology transfer and utilization instruction cours

Argument as an Act of Friendship

Those who are said to argue are typically seen as annoying, domineering types who treat conversation as a duel in which the goal is in the words of Gerry Spence\u27s recent bestseller, to win every time. The most immediate manifestation of this resistance to argument as both inescapable and healthful comes from our students; even when they learn to appreciate and evaluate tropes at an advanced level, they still often wonder aloud, Should I engage openly in argument? This paper aspires to paste a happy face on the practice of argument as a partial antidote to this resistance

Project for the analysis of technology transfer Quarterly evaluation report, 13 Oct. - 12 Dec. 1968

Technical support package usage documentation by technology transfer analysis projec

The Co-occurrence of child and intimate partner maltreatment in the family: characteristics of the violent perpetrators

This study considers the characteristics associated with mothers and fathers who maltreat their child and each other in comparison to parents who only maltreat their child. One hundred and sixty-two parents who had allegations of child maltreatment made against them were considered. The sample consisted of 43 fathers (Paternal Family—PF) and 23 mothers (Maternal Family—MF) who perpetrated both partner and child maltreatment, together with 23 fathers (Paternal Child—PC) and 26 mothers (Maternal Child—MC) who perpetrated child maltreatment only. In addition, 2 fathers (Paternal Victim—PV) and 23 mothers (Maternal Victim—MV) were victims of intimate partner maltreatment and perpetrators of child maltreatment and 7 fathers (Paternal Non-abusive Carer—PNC) and 15 mothers (Maternal Non-abusive Carer—MNC) did not maltreat the child but lived with an individual who did. Within their family unit, 40.7% of parents perpetrated both intimate partner and child maltreatment. However, fathers were significantly more likely to maltreat both their partner and child than mothers and mothers were significantly more likely to be victims of intimate partner violence than fathers. PF fathers conducted the highest amount of physical and/or sexual child maltreatment while MC and MV mothers perpetrated the highest amount of child neglect. Few significant differences between mothers were found. PF fathers had significantly more factors associated with development of a criminogenic lifestyle than PC fathers. Marked sex differences were demonstrated with PF fathers demonstrating significantly more antisocial characteristics, less mental health problems and fewer feelings of isolation than MF mothers. MC mothers had significantly more childhood abuse, mental health problems, parenting risk factors and were significantly more likely to be biologically related to the child than PC fathers. This study suggests that violent families should be assessed and treated in a holistic manner, considering the effects of partner violence upon all family members, rather than exclusively intervening with the violent man

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