MétaCan
Menu
Back to cohort
Record W2020893760 · doi:10.5555/2011383.2011386

Characterization of universal two-qubit hamiltonian

2011· article· en· W2020893760 on OpenAlexaff
Andrew M. Childs, Debbie Leung, Laura Mančinska, Māris Ozols

Bibliographic record

VenueQuantum Information and Computation · 2011
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsQubitHamiltonian (control theory)Unitary stateMathematicsUniversality (dynamical systems)Quantum mechanicsMathematical physicsPhysicsQuantumLaw

Abstract

fetched live from OpenAlex

Suppose we can apply a given 2-qubit Hamiltonian H to any (ordered) pair of qubits.We say H is n-universal if it can be used to approximate any unitary operation onn qubits. While it is well known that almost any 2-qubit Hamiltonian is 2-universal(Deutsch, Barenco, Ekert 1995; Lloyd 1995), an explicit characterization of the set ofnon-universal 2-qubit Hamiltonians has been elusive. Our main result is a completecharacterization of 2-non-universal 2-qubit Hamiltonians. In particular, there are threeways that a 2-qubit Hamiltonian H can fail to be universal: (1) H shares an eigenvectorwith the gate that swaps two qubits, (2) H acts on the two qubits independently (inany of a certain family of bases), or (3) H has zero trace (with the third conditionrelevant only when the global phase of the unitary matters). A 2-non-universal 2-qubitHamiltonian can still be n-universal for some n ≥ 3. We give some partial results on3-universality.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.961
Threshold uncertainty score0.377

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.012
GPT teacher head0.215
Teacher spread0.203 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations16
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueQuantum Information and ComputationSame topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207