We report on an experiment to detect non-classical correlations in a highly mixed state. The correlations are characterized by the quantum discord and are observed using four qubits in a liquid state nuclear magnetic resonance quantum information processor. The state analyzed is the output of a DQC1 computation, whose input is a single quantum bit accompanied by n maximally mixed qubits. This model of computation outperforms the best known classical algorithms, and although it contains vanishing entanglement it is known to have quantum correlations characterized by the quantum discord. This experiment detects non-vanishing quantum discord, ensuring the existence of non-classical correlations as measured by the quantum discord.

Interest in building dedicated quantum information science and engineering (QISE) education programs has greatly expanded in recent years. These programs are inherently convergent, complex, often resource intensive and likely require collaboration with a broad variety of stakeholders. In order to address this combination of challenges, we have captured ideas from many members in the community. This manuscript not only addresses policy makers and funding agencies (both public and private and from the regional to the international level) but also contains needs identified by industry leaders and discusses the difficulties inherent in creating an inclusive QISE curriculum. We report on the status of eighteen post-secondary education programs in QISE and provide guidance for building new programs. Lastly, we encourage the development of a comprehensive strategic plan for quantum education and workforce development as a means to make the most of the ongoing substantial investments being made in QISE.

We describe an efficient DQC1-algorithm to quantify the amount of Geometric Quantum Discord present in the output state of a DQC1 computation. DQC1 is a model of computation that utilizes separable states to solve a problem with no known efficient classical algorithm and is known to contain quantum correlations as measured by the discord. For the general case of a (1+n)-qubit DQC1-state we provide an analytical expression for the Geometric Quantum Discord and find that its typical (and maximum) value decreases exponentially with n. This is in contrast to the standard Quantum Discord whose value for typical DQC1-states is known to be independent of n. We experimentally demonstrate the proposed algorithm on a four-qubit liquid-state nuclear magnetic resonance quantum information processor. In the special case of a two-qubit DQC1 model, we also provide an expression for the Quantum Discord that only requires the outcome of the DQC1 algorithm.Comment: Editorial changes (most notably, the title) made to more accurately reflect the published versio

[This paper is part of the Focused Collection on Upper Division Physics Courses.] The time evolution of quantum states is arguably one of the more difficult ideas in quantum mechanics. In this article, we report on results from an investigation of student understanding of this topic after lecture instruction. We demonstrate specific problems that students have in applying time dependence to quantum systems and in recognizing the key role of the energy eigenbasis in determining the time dependence of wave functions. Through analysis of student responses to a set of four interrelated tasks, we categorize some of the difficulties that underlie common errors. The conceptual and reasoning difficulties that have been identified are illustrated through student responses to four sets of questions administered at different points in a junior-level course on quantum mechanics. Evidence is also given that the problems persist throughout undergraduate instruction and into the graduate level.

We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the deterministic quantum computation with one quantum bit model of quantum computation, which uses a single qubit accompanied by a register of completely random states. The Jones polynomial is a knot invariant that is important not only to knot theory, but also to statistical mechanics and quantum field theory. The implemented algorithm is a modification of the algorithm developed by Shor and Jordan suitable for implementation in NMR. These experimental results show that for the restricted case of knots whose braid representations have four strands and exactly three crossings, identifying distinct knots is possible 91% of the time.