Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2018

Highly Cited

2018

Cross-sentence n-ary relation extraction detects relations among n entities across multiple sentences. Typical methods formulate… Expand

Highly Cited

2018

Highly Cited

2018

Generating novel graph structures that optimize given objectives while obeying some given underlying rules is fundamental for… Expand

Highly Cited

2017

Highly Cited

2017

Blind quantum computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's… Expand

Highly Cited

2016

Highly Cited

2016

Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and… Expand

Highly Cited

2011

Highly Cited

2011

We give a construction for a self-test for any connected graph state. In other words, for each connected graph state we give a… Expand

Highly Cited

2009

Highly Cited

2009

This paper has two tightly intertwined aims: (i) to introduce an intuitive and universal graphical calculus for multi-qubit… Expand

Highly Cited

2009

Highly Cited

2009

Coecke and Duncan recently introduced a categorical formalisation of the interaction of complementary quantum observables. In… Expand

Highly Cited

2008

Highly Cited

2008

We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism… Expand

Highly Cited

2006

Highly Cited

2006

We introduce a flow condition on open graph states (graph states with inputs and outputs) which guarantees globally deterministic… Expand

Highly Cited

1999

Highly Cited

1999

Graphs play an important role within many areas of computer science. Rule-based languages, on the other hand, are well-suited for… Expand