Tau-lepton Physics at the FCC-ee circular e+^+e−^- Collider

The future FCC-ee collider is designed to deliver $\mathrm{e^+e^-}$ collisions to study with ultimate precision the Z, W, and Higgs bosons, and the top quark. In a high-statistics scan around the Z pole, $1.3\times 10^{11}$ events $\mathrm{Z}\to\tau\tau$ will be produced, the largest sample of $\tau\tau$ events foreseen at any lepton collider. With their large boost, $\tau$ leptons from Z decays are particularly well suited for precision measurements. The focus of this report is on tests of lepton universality from precision measurement of $\boldsymbol{\tau}$ properties and on tests of charged lepton flavour violation in Z decays and in $\tau$ decays. In both of these areas, FCC-ee promises sensitivities well beyond present experimental limits.Comment: 15 pages, 5 figures, 5 tables. Proceedings for the 15th International Workshop in Tau Lepton Physics. Update: fix referenc

Comment on "Quantum identification schemes with entanglements"

In a recent paper, [Phys. Rev. A 65, 052326 (2002)], Mihara presented several cryptographic protocols that were claimed to be quantum mechanical in nature. In this comment it is pointed out that these protocols can be described in purely classical terms. Hence, the security of these schemes does not rely on the usage of entanglement or any other quantum mechanical property.Comment: 2 pages, revtex

Quantum Oracle Interrogation: Getting all information for almost half the price

Consider a quantum computer in combination with a binary oracle of domain size N. It is shown how N/2+sqrt(N) calls to the oracle are sufficient to guess the whole content of the oracle (being an N bit string) with probability greater than 95%. This contrasts the power of classical computers which would require N calls to achieve the same task. From this result it follows that any function with the N bits of the oracle as input can be calculated using N/2+sqrt(N) queries if we allow a small probability of error. It is also shown that this error probability can be made arbitrary small by using N/2+O(sqrt(N)) oracle queries. In the second part of the article `approximate interrogation' is considered. This is when only a certain fraction of the N oracle bits are requested. Also for this scenario does the quantum algorithm outperform the classical protocols. An example is given where a quantum procedure with N/10 queries returns a string of which 80% of the bits are correct. Any classical protocol would need 6N/10 queries to establish such a correctness ratio.Comment: 11 pages LaTeX2e, 1 postscript figure; error analysis added; new section on approximate interrogation adde

Search for R-hadrons at the ATLAS experiment at the LHC

The latest search for massive long-lived hadronising particles with the ATLAS detector is presented. The search is conducted with the inner detector and an integrated luminosity corresponding to 2.06 fb-1 at sqrt(s) = 7 TeV. For Split-SUSY scenarios gluino masses below 810 GeV have been excluded.Comment: 4 pages, 4 figures, Proceedings of the XLVII Rencontres de Moriond, International Conference on Electroweak Interactions and Unified Theories, La Thuile, Italy, Mar. 4-10, 201

Two Classical Queries versus One Quantum Query

In this note we study the power of so called query-limited computers. We compare the strength of a classical computer that is allowed to ask two questions to an NP-oracle with the strength of a quantum computer that is allowed only one such query. It is shown that any decision problem that requires two parallel (non-adaptive) SAT-queries on a classical computer can also be solved exactly by a quantum computer using only one SAT-oracle call, where both computations have polynomial time-complexity. Such a simulation is generally believed to be impossible for a one-query classical computer. The reduction also does not hold if we replace the SAT-oracle by a general black-box. This result gives therefore an example of how a quantum computer is probably more powerful than a classical computer. It also highlights the potential differences between quantum complexity results for general oracles when compared to results for more structured tasks like the SAT-problem.Comment: 6 pages, LaTeX2e, no figures, minor changes and correction

The Dirac Composite Fermion of the Fractional Quantum Hall Effect

We review the recently proposed Dirac composite fermion theory of the half-filled Landau level.Comment: 19 pages. arXiv admin note: substantial text overlap with arXiv:1608.0511