output
20032026
most citedQuantum Critical Point of Itinerant Antiferromagnet in Heavy Fermion

34 citations

5 papers

quant-ph2026

Sparsity-dependent Complexity Lower Bound of Quantum Linear System Solvers

Hitomi Mori, Yuta Kikuchi, Marcello Benedetti +1

Quantum linear system (QLS) solvers are a fundamental class of quantum algorithms used in many potential quantum computing applications, including machine learning and solving diff…

quant-ph2024★ 1 cited

Erasure-tolerance scheme for the surface codes on neutral atom quantum computers

Fumiyoshi Kobayashi, Shota Nagayama

Neutral atom arrays manipulated with optical tweezers are promising candidates for fault-tolerant quantum computers due to their advantageous properties, such as scalability, long…

cs.LG2021★ 13 cited

LocalDrop: A Hybrid Regularization for Deep Neural Networks

Ziqing Lu, Chang Xu, Bo Du +3

In neural networks, developing regularization algorithms to settle overfitting is one of the major study areas. We propose a new approach for the regularization of neural networks…

cond-mat.str-el2005★ 34 cited

Quantum Critical Point of Itinerant Antiferromagnet in Heavy Fermion

Hiroaki Kadowaki, Yoshikazu Tabata, Masugu Sato +3

A quantum critical point (QCP) of the heavy fermion Ce(Ru_{1-x}Rh_x)_2Si_2 (x = 0, 0.03) has been studied by single-crystalline neutron scattering. By accurately measuring the dyna…

cond-mat.str-el2003★ 29 cited

Spin Fluctuation in Heavy Fermion CeRu_2Si_2

Hiroaki Kadowaki, Masugu Sato, Shuzo Kawarazaki

Spin fluctuations of the archetypal heavy-fermion compound CeRu_2Si_2 have been investigated by neutron scattering in an entire irreducible Brillouin zone. The dynamical susceptibi…