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
47 papers · 1 filter
Formulas vs. Circuits for Small Distance Connectivity
Benjamin Rossman
We give the first super-polynomial separation in the power of bounded-depth boolean formulas vs. circuits. Specifically, we consider the problem Distance Connectivity, which…
Suppressing epidemics on networks by exploiting observer nodes
Taro Takaguchi, Takehisa Hasegawa, Yuichi Yoshida
To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immun…
Computing the Geodesic Diameter and Center of a Simple Polygon in Linear Time
Sang Won Bae, Matias Korman, Yoshio Okamoto +1
In this paper, we show that the geodesic diameter and center of a simple polygon can be computed in linear time. For the purpose, we focus on revealing basic geometric proper…
Optical Soliton Propagation in a Free-Standing Nonlinear Graphene Monolayer with Defects
Frederick Ira Moxley, Tim Byrnes, Adarsh Radadia +1
Recently, optical soliton propagation in an intrinsic nonlinear graphene monolayer configuration has been discovered. However, optical soliton behavior in a free-standing graphene…
A Coherent Ising Machine Based On Degenerate Optical Parametric Oscillators
Zhe Wang, Alireza Marandi, Kai Wen +2
A degenerate optical parametric oscillator network is proposed to solve the NP-hard problem of finding a ground state of the Ising model. The underlying operating mechanism origina…
Fault-tolerant thresholds for quantum error correction with the surface code
Ashley M. Stephens
The surface code is a promising candidate for fault-tolerant quantum computation, achieving a high threshold error rate with nearest-neighbor gates in two spatial dimensions. Here,…
A new quantum version of f-divergence
Keiji Matsumoto
This paper proposes and studies new quantum version of -divergences, a class of convex functionals of a pair of probability distributions including Kullback-Leibler divergence,…
Data Search by a Laser Ising Machine with Gradual Pumping or Coupling
Kenta Takata, Yoshihisa Yamamoto
We study two operational schemes for a coherent Ising machine based on an injection-locked laser network. These schemes gradually increase the pumping rate or the mutual coupling a…
Photoluminescence of high-density exciton-polariton condensates
Natsuko Ishida, Tim Byrnes, Tomoyuki Horikiri +2
We examine the photoluminescence of highly-excited exciton-polariton condensates in semiconductor microcavities. Under strong pumping, exciton-polariton condensates have been obser…
Single-Shot Quantum Non-Demolition Measurement of a Quantum Dot Electron Spin, using Cavity Exciton-Polaritons
Shruti Puri, Peter McMahon, Yoshihisa Yamamoto
We propose a scheme to perform single-shot quantum non-demolition (QND) readout of the spin of an electron trapped in a semiconductor quantum dot (QD). Our proposal relies on the i…
A high-speed optical link to entangle quantum dots
Cody Jones, Kristiaan De Greve, Yoshihisa Yamamoto
A long-distance quantum network for distributing entangled states would support novel information applications, such as unconditionally secure cryptography and distributed quantum…
Observability transitions in correlated networks
Takehisa Hasegawa, Taro Takaguchi, Naoki Masuda
Yang, Wang, and Motter [Phys. Rev. Lett. 109, 258701 (2012)] analyzed a model for network observability transitions in which a sensor placed on a node makes the node and the adjace…
On the Parameterized Complexity of Associative and Commutative Unification
Tatsuya Akutsu, Takeyuki Tamura, Atsuhiro Takasu
This paper studies the unification problem with associative, commutative, and associative-commutative functions mainly from a viewpoint of the parameterized complexity on the numbe…
Spider covers for prize-collecting network activation problem
Takuro Fukunaga
In the network activation problem, each edge in a graph is associated with an activation function, that decides whether the edge is activated from node-weights assigned to its end-…
Half-integrality, LP-branching and FPT Algorithms
Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida
A recent trend in parameterized algorithms is the application of polytope tools (specifically, LP-branching) to FPT algorithms (e.g., Cygan et al., 2011; Narayanaswamy et al., 2012…
Better Bounds for Online -Frame Throughput Maximization in Network Switches
Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki
We consider a variant of the online buffer management problem in network switches, called the -frame throughput maximization problem (-FTM). This problem models the situation…
Photonic architecture for scalable quantum information processing in NV-diamond
Kae Nemoto, Michael Trupke, Simon J. Devitt +6
Physics and information are intimately connected, and the ultimate information processing devices will be those that harness the principles of quantum mechanics. Many physical syst…
High fidelity gate operations within the coupled nuclear and electron spins of a nitrogen vacancy center in diamond
Mark S. Everitt, Simon Devitt, W. J. Munro +1
In this article we investigate the dynamics of a single negatively charged nitrogen-vacancy center (NV-) coupled to the spin of the nucleus of a 15-nitrogen atom and show that high…
Induction by Coinduction and Control Operators in Call-by-Name
Yoshihiko Kakutani, Daisuke Kimura
This paper studies emulation of induction by coinduction in a call-by-name language with control operators. Since it is known that call-by-name programming languages with control o…
Enumeration of PLCP-orientations of the 4-cube
Lorenz Klaus, Hiroyuki Miyata
The linear complementarity problem (LCP) provides a unified approach to many problems such as linear programs, convex quadratic programs, and bimatrix games. The general LCP is kno…
Towards Realizing a Quantum Memory for a Superconducting Qubit: Storage and Retrieval of quantum states
Shiro Saito, Xiaobo Zhu, Robert Amsüss +7
We have built a hybrid system composed of a superconducting flux qubit (the processor) and an ensemble of nitrogen-vacancy centers in diamond (the memory) that can be directly coup…
Entanglement generation in quantum networks of Bose-Einstein condensates
Alexey N. Pyrkov, Tim Byrnes
Two component (spinor) Bose-Einstein condensates (BECs) are considered as the nodes of an interconnected quantum network. Unlike standard single-system qubits, in a BEC the quantum…
High-threshold topological quantum error correction against biased noise
Ashley M. Stephens, William J. Munro, Kae Nemoto
Quantum information can be protected from decoherence and other errors, but only if these errors are sufficiently rare. For quantum computation to become a scalable technology, pra…
Detecting Superbubbles in Assembly Graphs
Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya
We introduce a new concept of a subgraph class called a superbubble for analyzing assembly graphs, and propose an efficient algorithm for detecting it. Most assembly algorithms uti…