431 research outputs found

    Theories of Reference: What Was the Question?

    Get PDF
    The new theory of reference has won popularity. However, a number of noted philosophers have also attempted to reply to the critical arguments of Kripke and others, and aimed to vindicate the description theory of reference. Such responses are often based on ingenious novel kinds of descriptions, such as rigidified descriptions, causal descriptions, and metalinguistic descriptions. This prolonged debate raises the doubt whether different parties really have any shared understanding of what the central question of the philosophical theory of reference is: what is the main question to which descriptivism and the causal-historical theory have presented competing answers. One aim of the paper is to clarify this issue. The most influential objections to the new theory of reference are critically reviewed. Special attention is also paid to certain important later advances in the new theory of reference, due to Devitt and others

    Integration of highly probabilistic sources into optical quantum architectures: perpetual quantum computation

    Full text link
    In this paper we introduce a design for an optical topological cluster state computer constructed exclusively from a single quantum component. Unlike previous efforts we eliminate the need for on demand, high fidelity photon sources and detectors and replace them with the same device utilised to create photon/photon entanglement. This introduces highly probabilistic elements into the optical architecture while maintaining complete specificity of the structure and operation for a large scale computer. Photons in this system are continually recycled back into the preparation network, allowing for a arbitrarily deep 3D cluster to be prepared using a comparatively small number of photonic qubits and consequently the elimination of high frequency, deterministic photon sources.Comment: 19 pages, 13 Figs (2 Appendices with additional Figs.). Comments welcom

    Effects of imperfections for Shor's factorization algorithm

    Full text link
    We study effects of imperfections induced by residual couplings between qubits on the accuracy of Shor's algorithm using numerical simulations of realistic quantum computations with up to 30 qubits. The factoring of numbers up to N=943 show that the width of peaks, which frequencies allow to determine the factors, grow exponentially with the number of qubits. However, the algorithm remains operational up to a critical coupling strength ϵc\epsilon_c which drops only polynomially with log2N\log_2 N. The numerical dependence of ϵc\epsilon_c on log2N\log_2 N is explained by analytical estimates that allows to obtain the scaling for functionality of Shor's algorithm on realistic quantum computers with a large number of qubits.Comment: 10 pages, 10 figures, 1 table. Added references and new data. Erratum added as appendix. 1 Figure and 1 Table added. Research is available at http://www.quantware.ups-tlse.fr

    Limitations of student-driven formative assessment in a clinical clerkship. A randomised controlled trial

    Get PDF
    Background Teachers strive to motivate their students to be self-directed learners. One of the methods used is to provide online formative assessment material. The concept of formative assessment and use of these processes is heavily promoted, despite limited evidence as to their efficacy.Methods Fourth year medical students, in their first year of clinical work were divided into four groups. In addition to the usual clinical material, three of the groups were provided with some form of supplementary learning material. For two groups, this was provided as online formative assessment. The amount of time students spent on the supplementary material was measured, their opinion on learning methods was surveyed, and their performance in summative exams at the end of their surgical attachments was measured.Results The performance of students was independent of any educational intervention imposed by this study. Despite its ready availability and promotion, student use of the online formative tools was poor.Conclusion Formative learning is an ideal not necessarily embraced by students. If formative assessment is to work students need to be encouraged to participate, probably by implementing some form of summative assessment.Edward J Palmer and Peter G Devit

    Perfect-fluid cylinders and walls - sources for the Levi-Civita space-time

    Get PDF
    The diagonal metric tensor whose components are functions of one spatial coordinate is considered. Einstein's field equations for a perfect-fluid source are reduced to quadratures once a generating function, equal to the product of two of the metric components, is chosen. The solutions are either static fluid cylinders or walls depending on whether or not one of the spatial coordinates is periodic. Cylinder and wall sources are generated and matched to the vacuum (Levi--Civita) space--time. A match to a cylinder source is achieved for -\frac{1}{2}<\si<\frac{1}{2}, where \si is the mass per unit length in the Newtonian limit \si\to 0, and a match to a wall source is possible for |\si|>\frac{1}{2}, this case being without a Newtonian limit; the positive (negative) values of \si correspond to a positive (negative) fluid density. The range of \si for which a source has previously been matched to the Levi--Civita metric is 0\leq\si<\frac{1}{2} for a cylinder source.Comment: 22 pages, LaTeX, one included figure. Revised version: three (non-perfect-fluid) interior solutions are added, one of which falsifies the original conjecture in Sec. 4, and the circular geodesics of the Levi-Civita space-time are discussed in a footnot

    Coherent State Topological Cluster State Production

    Full text link
    We present results illustrating the construction of 3D topological cluster states with coherent state logic. Such a construction would be ideally suited to wave-guide implementations of quantum optical processing. We investigate the use of a ballistic CSign gate, showing that given large enough initial cat states, it is possible to build large 3D cluster states. We model X and Z basis measurements by displaced photon number detections and x-quadrature homodyne detections, respectively. We investigate whether teleportation can aid cluster state construction and whether the introduction of located loss errors fits within the topological cluster state framework.Comment: 9 pages, 17 figure

    Simulating chemistry efficiently on fault-tolerant quantum computers

    Get PDF
    Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm [C.M. Dawson and M.A. Nielsen, \emph{Quantum Inf. Comput.}, \textbf{6}:81, 2006]. For a given approximation error ϵ\epsilon, arbitrary single-qubit gates can be produced fault-tolerantly and using a limited set of gates in time which is O(logϵ)O(\log \epsilon) or O(loglogϵ)O(\log \log \epsilon); with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for Lithium hydride.Comment: 33 pages, 18 figure

    Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics

    Full text link
    In a large-scale quantum computer, the cost of communications will dominate the performance and resource requirements, place many severe demands on the technology, and constrain the architecture. Unfortunately, fault-tolerant computers based entirely on photons with probabilistic gates, though equipped with "built-in" communication, have very large resource overheads; likewise, computers with reliable probabilistic gates between photons or quantum memories may lack sufficient communication resources in the presence of realistic optical losses. Here, we consider a compromise architecture, in which semiconductor spin qubits are coupled by bright laser pulses through nanophotonic waveguides and cavities using a combination of frequent probabilistic and sparse determinstic entanglement mechanisms. The large photonic resource requirements incurred by the use of probabilistic gates for quantum communication are mitigated in part by the potential high-speed operation of the semiconductor nanophotonic hardware. The system employs topological cluster-state quantum error correction for achieving fault-tolerance. Our results suggest that such an architecture/technology combination has the potential to scale to a system capable of attacking classically intractable computational problems.Comment: 29 pages, 7 figures; v2: heavily revised figures improve architecture presentation, additional detail on physical parameters, a few new reference

    Electronic learning can facilitate student performance in undergraduate surgical education: a prospective observational study

    Get PDF
    BACKGROUND: Our institution recently introduced a novel internet accessible computer aided learning (iCAL) programme to complement existing surgical undergraduate teaching methods. On graduation of the first full cycle of undergraduate students to whom this resource was available we assessed the utility of this new teaching facility. METHOD: The computer programme prospectively records usage of the system on an individual user basis. We evaluated the utilisation of the web-based programme and its impact on class ranking changes from an entry-test evaluation to an exit examination in surgery. RESULTS: 74.4% of students were able to access iCAL from off-campus internet access. The majority of iCAL usage (64.6%) took place during working hours (08:00–18:00) with little usage on the weekend (21.1%). Working hours usage was positively associated with improvement in class rank (P = 0.025, n = 148) but out-of hours usage was not (P = 0.306). Usage during weekdays was associated with improved rank (P = 0.04), whereas weekend usage was not (P = 0.504). There were no significant differences in usage between genders (P = 0.3). Usage of the iCAL system was positively correlated with improvement in class rank from the entry to the exit examination (P = 0.046). Students with lower ranks on entry examination, were found to use the computer system more frequently (P = 0.01). CONCLUSION: Electronic learning complements traditional teaching methods in undergraduate surgical teaching. Its is more frequently used by students achieving lower class ranking with traditional teaching methods, and this usage is associated with improvements in class ranking

    The Pandora multi-algorithm approach to automated pattern recognition of cosmic-ray muon and neutrino events in the MicroBooNE detector

    Get PDF
    The development and operation of Liquid-Argon Time-Projection Chambers for neutrino physics has created a need for new approaches to pattern recognition in order to fully exploit the imaging capabilities offered by this technology. Whereas the human brain can excel at identifying features in the recorded events, it is a significant challenge to develop an automated, algorithmic solution. The Pandora Software Development Kit provides functionality to aid the design and implementation of pattern-recognition algorithms. It promotes the use of a multi-algorithm approach to pattern recognition, in which individual algorithms each address a specific task in a particular topology. Many tens of algorithms then carefully build up a picture of the event and, together, provide a robust automated pattern-recognition solution. This paper describes details of the chain of over one hundred Pandora algorithms and tools used to reconstruct cosmic-ray muon and neutrino events in the MicroBooNE detector. Metrics that assess the current pattern-recognition performance are presented for simulated MicroBooNE events, using a selection of final-state event topologies.Comment: Preprint to be submitted to The European Physical Journal
    corecore