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
51 papers · 1 filter
Photonic Quantum Networks formed from NV- Centers
Kae Nemoto, M. Trupke, S. J. Devitt +4
In this article we present a simple repeater scheme based on the negatively-charged nitrogen vacancy centre in diamond (NV-). Each repeater node is built from simple modules compri…
Robust entanglement-based magnetic field sensor beyond the standard quantum limit
Tohru Tanaka, Paul Knott, Yuichiro Matsuzaki +4
Recently, there have been significant developments in entanglement-based quantum metrology. However, entanglement is fragile against experimental imperfections, and quantum sensing…
Learning Word Representations from Relational Graphs
Danushka Bollegala, Takanori Maehara, Yuichi Yoshida +1
Attributes of words and relations between two words are central to numerous tasks in Artificial Intelligence such as knowledge representation, similarity measurement, and analogy d…
Beyond the Euler characteristic: Approximating the genus of general graphs
Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter alg…
Leveraging Monolingual Data for Crosslingual Compositional Word Representations
Hubert Soyer, Pontus Stenetorp, Akiko Aizawa
In this work, we present a novel neural network based architecture for inducing compositional crosslingual word representations. Unlike previously proposed methods, our method fulf…
Time evolution of predictability of epidemics on networks
Petter Holme, Taro Takaguchi
Epidemic outbreaks of new pathogens, or known pathogens in new populations, cause a great deal of fear because they are hard to predict. For theoretical models of disease spreading…
Competitive Local Routing with Constraints
Prosenjit Bose, Rolf Fagerberg, André van Renssen +1
Let be a set of vertices in the plane and a set of non-crossing line segments between vertices in , called constraints. Two vertices are visible if the straight line…
Efficient SimRank Computation via Linearization
Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi
SimRank, proposed by Jeh and Widom, provides a good similarity measure that has been successfully used in numerous applications. While there are many algorithms proposed for comput…
Full Bloch sphere teleportation of spinor Bose-Einstein condensates and spin ensembles
Alexey N. Pyrkov, Tim Byrnes
Quantum teleportation is the transfer of quantum information between two locations by the use of shared entanglement. Current teleportation schemes broadly fall under one of two ca…
Exciton-polariton condensates
Tim Byrnes, Na Young Kim, Yoshihisa Yamamoto
Recently a new type of system exhibiting spontaneous coherence has emerged -- the exciton-polariton condensate. Exciton-polaritons (or polaritons for short) are bosonic quasipartic…
Variable-Order de Bruijn Graphs
Christina Boucher, Alex Bowe, Travis Gagie +2
The de Bruijn graph of a set of strings is a key data structure in genome assembly that represents overlaps between all the -length substrings of . Construction and…
The Directed Grid Theorem
Ken-ichi Kawarabayashi, Stephan Kreutzer
The grid theorem, originally proved by Robertson and Seymour in Graph Minors V in 1986, is one of the most central results in the study of graph minors. It has found numerous appli…
Precision Measurements Using Squeezed Spin States via Two-axis Counter-twisting Interactions
Emi Yukawa, Gerard Milburn, Masahito Ueda +1
We show that the two-axis counter twisting interaction squeezes a coherent spin state into three states of interest in quantum information, namely, the twin-Fock state, the equally…
Macroscopic quantum information processing using spin coherent states
Tim Byrnes, Daniel Rosseau, Megha Khosla +6
Previously a new scheme of quantum information processing based on spin coherent states of two component Bose-Einstein condensates was proposed (Byrnes {\it et al.} Phys. Rev. A 85…
Entanglement generation between two spinor Bose-Einstein condensates with cavity QED
Daniel Rosseau, Qianqian Ha, Tim Byrnes
We analyze a scheme for generating entanglement between two spinor Bose-Einstein condensates (BECs). The BECs are off-resonantly coupled to a common photon mode and are controlled…
Sufficient conditions of endemic threshold on metapopulation networks
Taro Takaguchi, Renaud Lambiotte
In this paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks, where nodes represent subpopulations, and where agents diffuse and interact. Recent…
High-speed quantum networking by ship
Simon J. Devitt, Andrew D. Greentree, Ashley M. Stephens +1
Networked entanglement is an essential component for a plethora of quantum computation and communication protocols. Direct transmission of quantum signals over long distances is pr…
Fluctuation scaling in neural spike trains
Shinsuke Koyama, Ryota Kobayashi
Fluctuation scaling has been observed universally in a wide variety of phenomena. In time series that describe sequences of events, fluctuation scaling is expressed as power functi…
Impossibility of Classically Simulating One-Clean-Qubit Computation
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae +3
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input state is the completely mixed state except for a single cle…
Initialization of a spin qubit in a site-controlled nanowire quantum dot
Konstantinos G. Lagoudakis, Peter L. McMahon, Kevin A. Fischer +8
A fault-tolerant quantum repeater or quantum computer using solid-state spin-based quantum bits will likely require a physical implementation with many spins arranged in a grid. Se…
A characterization of -minor-free graphs
M. N. Ellingham, Emily A. Marshall, Kenta Ozeki +1
We provide a complete structural characterization of -minor-free graphs. The -connected -minor-free graphs consist of nine small graphs on at most eight vertic…
Optical Manipulation of Quantum Dot Electron Spin Qubits Using Microcavity Quantum Well Exciton-Polaritons
Shruti Puri, Peter L. McMahon, Yoshihisa Yamamoto
In this paper we introduce and analyze a new system design for quantum-dot-based qubits that simultaneously supports scalable one-qubit and two-qubit gates, and single-shot qubit m…
Cross-level Validation of Topological Quantum Circuits
Alexandru Paler, Simon J. Devitt, Kae Nemoto +1
Quantum computing promises a new approach to solving difficult computational problems, and the quest of building a quantum computer has started. While the first attempts on constru…
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
In this paper, we address the problem of enumerating all induced subtrees in an input k-degenerate graph, where an induced subtree is an acyclic and connected induced subgraph. A g…