2.9k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- The University of TokyoJP171 papers
- The Graduate University for Advanced Studies, SOKENDAIJP129 papers
- NTT Basic Research LaboratoriesJP96 papers
- Stanford UniversityUS80 papers
- Japan Science and Technology AgencyJP63 papers
- NTT (Japan)JP60 papers
- Centre National de la Recherche ScientifiqueFR55 papers
- New York UniversityUS49 papers
- New York University ShanghaiCN49 papers
- Hewlett-Packard (United Kingdom)GB41 papers
- East China Normal UniversityCN38 papers
- Japanese-French Laboratory for InformaticsJP38 papers
30 papers · 1 filter
The negative Bogoliubov dispersion in exciton-polariton condensates
Tim Byrnes, Tomoyuki Horikiri, Natsuko Ishida +2
Bogoliubov's theory states that self-interaction effects in Bose-Einstein condensates produce a characteristic linear dispersion at low momenta. One of the curious features of Bogo…
Coherent coupling of a superconducting flux-qubit to an electron spin ensemble in diamond
Xiaobo Zhu, Shiro Saito, Alexander Kemp +10
Electron-spin nitrogen-vacancy color centers in diamond are a natural candidate to act as a quantum memory for superconducting qubits because of their large collective coupling and…
Layer by layer generation of cluster states
Katherine L. Brown, Dominic Horsman, Viv Kendon +1
Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and me…
Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems
Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj +1
This paper proves that classical-witness quantum Merlin-Arthur proof systems can achieve perfect completeness. That is, QCMA = QCMA1. This holds under any gate set with which the H…
The competition hypergraphs of doubly partial orders
Suh-Ryung Kim, Jung Yeun Lee, Boram Park +1
Since Cho and Kim (2005) showed that the competition graph of a doubly partial order is an interval graph, it has been actively studied whether or not the same phenomenon occurs fo…
Surface code quantum computing by lattice surgery
Dominic Horsman, Austin G. Fowler, Simon Devitt +1
In recent years, surface codes have become a leading method for quantum error correction in theoretical large scale computational and communications architecture designs. Their com…
Computing a visibility polygon using few variables
Luis Barba, Matias Korman, Stefan Langerman +1
We present several algorithms for computing the visibility polygon of a simple polygon from a viewpoint inside the polygon, when the polygon resides in read-only memory and onl…
Syndromic classification of Twitter messages
Nigel Collier, Son Doan
Recent studies have shown strong correlation between social networking data and national influenza rates. We expanded upon this success to develop an automated text mining system t…
What's unusual in online disease outbreak news?
Nigel Collier
Background: Accurate and timely detection of public health events of international concern is necessary to help support risk assessment and response and save lives. Novel event-bas…
OMG U got flu? Analysis of shared health messages for bio-surveillance
Nigel Collier, Nguyen Truong Son, Ngoc Mai Nguyen
Background: Micro-blogging services such as Twitter offer the potential to crowdsource epidemics in real-time. However, Twitter posts ('tweets') are often ambiguous and reactive to…
Towards cross-lingual alerting for bursty epidemic events
Nigel Collier
Background: Online news reports are increasingly becoming a source for event based early warning systems that detect natural disasters. Harnessing the massive volume of information…
The competition number of a generalized line graph is at most two
Boram Park, Yoshio Sano
In 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one.…
Choosability of planar graphs of girth 5
Zdenek Dvorak, Ken-ichi Kawarabayashi
Thomassen proved that any plane graph of girth 5 is list-colorable from any list assignment such that all vertices have lists of size two or three and the vertices with list of siz…
An analysis of Twitter messages in the 2011 Tohoku Earthquake
Son Doan, Bao-Khanh Ho Vo, Nigel Collier
Social media such as Facebook and Twitter have proven to be a useful resource to understand public opinion towards real world events. In this paper, we investigate over 1.5 million…
Photon phonon entanglement in coupled optomechanical arrays
Uzma Akram, William Munro, Kae Nemoto +1
We consider an array of three optomechanical cavities coupled either reversibly or irreversibly to each other and calculate the amount of entanglement between the different optical…
Confidentiality-Preserving Data Publishing for Credulous Users by Extended Abduction
Katsumi Inoue, Chiaki Sakama, Lena Wiese
Publishing private data on external servers incurs the problem of how to avoid unwanted disclosure of confidential data. We study a problem of confidentiality in extended disjuncti…
Cliques in Odd-Minor-Free Graphs
Ken-ichi Kawarabayashi, David R. Wood
This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that…
SU(N)-symmetric quasi-probability distribution functions
Todd Tilma, Kae Nemoto
We present a set of N-dimensional functions, based on generalized SU(N)-symmetric coherent states, that represent finite-dimensional Wigner functions, Q-functions, and P-functions.…
Normative design using inductive learning
Domenico Corapi, Alessandra Russo, Marina De Vos +2
In this paper we propose a use-case-driven iterative design methodology for normative frameworks, also called virtual institutions, which are used to govern open systems. Our compu…
Coherent control and suppressed nuclear feedback of a single quantum dot hole qubit
Kristiaan De Greve, Peter L. McMahon, David Press +8
Future communication and computation technologies that exploit quantum information require robust and well-isolated qubits. Electron spins in III-V semiconductor quantum dots, whil…
Efficient quantum computing using coherent photon conversion
N. K. Langford, S. Ramelow, R. Prevedel +3
Single photons provide excellent quantum information carriers, but current schemes for preparing, processing and measuring them are inefficient. For example, down-conversion provid…
Poplar: A Java Extension for Evolvable Component Integration
Johan Nyström-Persson, Shinichi Honiden
The Java programming language contains many features that aid component-based software development (CBSD), such as interfaces, visibility levels, and strong support for encapsulati…
Type Inference for Bimorphic Recursion
Makoto Tatsuta, Ferruccio Damiani
This paper proposes bimorphic recursion, which is restricted polymorphic recursion such that every recursive call in the body of a function definition has the same type. Bimorphic…
The parameterized complexity of k-edge induced subgraphs
Bingkai Lin, Yijia Chen
We prove that finding a -edge induced subgraph is fixed-parameter tractable, thereby answering an open problem of Leizhen Cai. Our algorithm is based on several combinatorial ob…