output
20022015
most citedExponential algorithmic speedup by quantum walk

836 citations

Showing 2012Show all

31 papers · 1 filter

quant-ph20126 cited

Entanglement Sharing Protocol via Quantum Error Correcting Codes

Ran Hee Choi, Ben Fortescue, Gilad Gour +1

We introduce a new multiparty cryptographic protocol, which we call `entanglement sharing schemes', wherein a dealer retains half of a maximally-entangled bipartite state and encod…

quant-ph2012162 cited

Exact synthesis of multiqubit Clifford+T circuits

Brett Giles, Peter Selinger

We prove that a unitary matrix has an exact representation over the Clifford+T gate set with local ancillas if and only if its entries are in the ring Z[1/sqrt(2),i]. Moreover, we…

math.CT2012

Restriction categories as enriched categories

Robin Cockett, Richard Garner

Restriction categories were introduced to provide an axiomatic setting for the study of partially defined mappings; they are categories equipped with an operation called restrictio…

cond-mat.stat-mech201250 cited

Information theoretic aspects of the two-dimensional Ising model

Hon Wai Lau, Peter Grassberger

We present numerical results for various information theoretic properties of the square lattice Ising model. First, using a bond propagation algorithm, we find the difference $2H_L…

math.NT20122 cited

The -adic Shintani cocycle

G. Ander Steele

The Shintani cocycle on $\GL_n(\Q)$, as constructed by Hill, gives a cohomological interpretation of special values of zeta functions for totally real fields of degree . We give…

math.CO20122 cited

The -Dominating Graph

Ruth Haas, Karen Seyffarth

Given a graph , the -dominating graph of , , is defined to be the graph whose vertices correspond to the dominating sets of that have cardinality at most .…