22 results
Relevance Newest Most Cited
HLXiON δ Ω Intent Σ Logic Ψ Synth Π Reason Γ Memory Processing: quant-ph
iON AI Synthesis
The search results on "quant-ph" reveal a range of discussions in quantum physics. Notably, some papers have been withdrawn and replaced, such as the one on local equivalence classes of mixed two-qubit states, now superseded by Makhlin's work (quant-ph/0002045), and another on distinguishability heuristics, replaced by quant-ph/0308160. Additionally, there's commentary on eavesdropping in ping-pong communication protocols and discussions on improving transition probability calculations and the comparative strengths of quantum over classical computing, highlighting Shor's algorithm's impact on factoring and discrete logarithms.
Ask iON more → 📚 Find Papers
arxiv.org
The space of local equivalence classes of mixed two-qubit states

This paper is withdrawn by the author. It is superseded by Makhlin's paper quant-ph/0002045.…

quant-ph
arxiv.org
Comment on 'Eavesdropping on the ping-pong communication protocol'

This is a comment on PRL90(03)157901 by Antoni Wojcik (quant-ph/0211199)…

quant-ph
arxiv.org
Formalization of the distinguishability heuristics

Withdrawn. Replaced by quant-ph/0308160 (cf accompanying txt file)…

quant-ph
arxiv.org
A case concerning the improved transition probability

As is well known, the existed perturbation theory can be applied to calculations of energy, state and transition probability in many quantum systems. However, there are different paths and methods to improve its calculation precision and efficiency in our view. According to an improved scheme of per…

quant-ph physics.atom-ph
arxiv.org
Strengths and Weaknesses of Quantum Computing

Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of discrete logarithms are both solvable in quan…

quant-ph
arxiv.org
Cavity QED and Quantum Computation in the Weak Coupling Regime II : Complete Construction of the Controlled-Controlled NOT Gate

In this paper we treat a cavity QED quantum computation. Namely, we consider a model of quantum computation based on n atoms of laser-cooled and trapped linearly in a cavity and realize it as the n atoms Tavis-Cummings Hamiltonian interacting with n external (laser) fields. We solve the Schr{\" o}…

quant-ph
arxiv.org
A portrait of the collaboration network in quantum information

From its inception at the beginning of the eighties, with milestone results and ideas such as quantum simulation, the no-cloning theorem, and quantum computers, quantum information has established itself over the next decades, being nowadays a fast-developing field at the interface between fundament…

physics.soc-ph quant-ph
arxiv.org
History of Lattice Field Theory from a Statistical Perspective

Researchers working in lattice field theory constitute an established community since the early 1990s, and around the same time the online open-access e-print repository arXiv was created. The fact that this field has a specific arXiv section, hep-lat, which is comprehensively used, provides a uniqu…

hep-lat physics.hist-ph physics.soc-ph
arxiv.org
Another Survey of Foundational Attitudes Towards Quantum Mechanics

Although it has been almost 100 years since the beginnings of quantum mechanics, the discussions about its interpretation still do not cease. Therefore, a survey of opinions regarding this matter is of particular interest. This poll was conducted following an idea and using the methodology of Schlos…

quant-ph physics.hist-ph
arxiv.org
A Mechanism for Entanglement?

We propose that quantum entanglement is a special sort of selection artefact, explicable as a combination of (i) collider bias and (ii) a boundary constraint on the collider variable. We show that the proposal is valid for a special class of (`W-shaped') Bell experiments involving delayed-choice ent…

quant-ph physics.hist-ph