331 citations
- Kiryu UniversityJP36 papers
- Ibaraki UniversityJP30 papers
- Kyoto UniversityJP29 papers
- The University of TokyoJP27 papers
- Nagoya UniversityJP23 papers
- The University of OsakaJP21 papers
- Tokyo Institute of TechnologyJP17 papers
- Chapman UniversityUS16 papers
- National Astronomical Observatory of JapanJP16 papers
- Niigata UniversityJP16 papers
- Japan Science and Technology AgencyJP14 papers
- Osaka City UniversityJP14 papers
14 papers · 1 filter
Ordered Biclique Partitions and Communication Complexity Problems
Manami Shigeta, Kazuyuki Amano
An ordered biclique partition of the complete graph on vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of is covere…
Landau-Lifshitz's conjecture about the motion of a quantum mechanical particle under the inverse square potential
Motohiro Sobajima, Shuji Watanabe
Landau and Lifshitz [4, Section 35] conjectured that for an arbitrary , there exists the motion of a quantum mechanical particle under the inverse square potential…
On the hardness of classically simulating the one clean qubit model
Tomoyuki Morimae, Keisuke Fujii, Joseph F. Fitzsimons
Deterministic quantum computation with one quantum bit (DQC1) is a model of quantum computing where the input restricted to containing a single qubit in a pure state and with all o…
Interplay between Hund's coupling and spin-orbit interaction on elementary excitations in Sr2IrO4
Jun-ichi Igarashi, Tatsuya Nagao
We study the elementary excitations in 5d transition metal oxideSrIrO by calculating the particle-hole Green's function within the random phase approximation on an antiferr…
Magnetic excitation in resonant inelastic x-ray scattering of SrIrO: A localized spin picture
Jun-ichi Igarashi, Tatsuya Nagao
We study the magnetic excitations in 5d transition-metal oxide SrIrO on the basis of the Heisenberg model with small anisotropic terms on a square lattice. We calculate the…
Quantum Commuting Circuits and Complexity of Ising Partition Functions
Keisuke Fujii, Tomoyuki Morimae
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard…