SESuguru Endo

Suguru Endo

*This is an algorithmically generated author record based on publicly available information.

Suguru Endo has a total of 11 co-authors. Here are the top co-authors by number of shared publications:

  • Hiroyuki Harada

    Graduate School of Science and Technology Keio University Hiyoshi 3-14-1 223-8522 Kohoku Yokohama Japan

    2 shared publications
  • Yuuki Tokunaga

    NTT Computer and Data Science laboratories NTT corporation 180-8585 Musashino Tokyo Japan

    2 shared publications
  • Bo Yang

    LIP6, Sorbonne Université, 4 Place Jussieu, Paris 75005, France

    1 shared publication
  • Gabriel Mintzer

    MIT Department of Electrical Engineering and Computer Science 50 Vassar St 02139 Cambridge MA USA

    1 shared publication
  • Kaito Wada

    Graduate School of Science and Technology Keio University Hiyoshi 3-14-1 223-8522 Kohoku Yokohama Japan

    1 shared publication
  • Naoki Yamamoto

    Department of Applied Physics and Physico-Informatics Keio University Hiyoshi 3-14-1 223-8522 Kohoku Yokohama Japan

    1 shared publication

Latest Publications

  • Open Access

    Exponential-to-polynomial scaling of measurement overhead in circuit knitting via quantum tomography

    by Hiroyuki Harada, Kaito Wada, Naoki Yamamoto, Suguru Endo

    Circuit knitting is a family of techniques that enables large quantum computations on limited-size quantum devices by decomposing a target circuit into smaller subcircuits. However, it typically incurs a measurement overhead exponential in the number of cut locations, and it remains open whether this scaling is fundamentally unavoidable. In conventional circuit-cutting approaches based on the quasiprobability decomposition (QPD), for example, rescaling factors lead to an exponential dependence on the number of cuts. In this work, we show that such an exponential scaling is not universal: it can be circumvented for tree-structured quantum circuits via concatenated quantum tomography protocols. We first consider estimating the expectation value of an observable within additive error $ε$ for a tree-structured circuit with tree depth 1 (two layers), maximum branching factor $R$, and bond dimension at most $d$ on each edge. Our approach uses quantum tomography to construct, for each cut edge, a local decomposition that eliminates the rescaling factors in conventional QPD, instead introducing a controllable bias set by the tomography sample size. After cutting $R$ edges, we show that $\mathcal{O}(d^3R^3\ln(dR)/ε^2)$ total measurements suffice, including tomography cost. Next, we extend the tree-depth-1 case to general trees of depth $L\geq2$, and give an algorithm whose total measurement cost $\tilde{\mathcal{O}}(d^3K^{5}/ε^2)$ scales polynomially with the number of cuts for complete $R$-ary trees. Finally, we perform an information-theoretic analysis to show that, in a comparable tree-depth-1 setting, conventional QPD-based wire-cutting methods require at least $Ω((d+1)^R/ε^2)$ measurements. This exponential separation highlights the significance of tomography-based construction for reducing measurement overhead in hybrid quantum-classical computations.

  • Open Access

    Exploiting Translational Symmetry for Quantum Computing with Squeezed Cat Qubits

    by Tomohiro Shitara, Gabriel Mintzer, Yuuki Tokunaga, Suguru Endo

    Squeezed cat quantum error correction (QEC) codes have garnered attention because of their robustness against photon-loss and excitation errors while maintaining the biased-noise property of cat codes. In this work, we reveal the utility of the unexplored translational symmetry of the squeezed cat codes, with applications to autonomous QEC, reliable logical operations, and readout in a non-orthogonal basis. Using the basis under subsystem decomposition spanned by squeezed displaced Fock states, we analytically show that our autonomous QEC protocol allows for correcting logical errors due to photon loss, although the translational symmetry in one direction does not uniquely specify the code space. We also introduce the implementation methods of reliable logical operations by repeated alternation of a small-step unitary operation with a subsequent step of QEC onto the code space. Finally, by appropriately treating the non-Hermitian nature of the logical $Z$ operator, we also propose a circuit for precisely reading out the squeezed cat code in a non-orthogonal basis.

  • Open Access

    Density matrix representation of hybrid tensor networks for noisy quantum devices

    by Hiroyuki Harada, Yasunari Suzuki, Bo Yang, Yuuki Tokunaga, Suguru Endo

    The hybrid tensor network (HTN) method is a general framework allowing for the construction of an effective wavefunction with the combination of classical tensors and quantum tensors, i.e., amplitudes of quantum states. In particular, hybrid tree tensor networks (HTTNs) are very useful for simulating larger systems beyond the available size of the quantum hardware. However, while the realistic quantum states in NISQ hardware are highly likely to be noisy, this framework is formulated for pure states. In this work, as well as discussing the relevant methods, i.e., Deep VQE and entanglement forging under the framework of HTTNs, we investigate the noisy HTN states by introducing the expansion operator for providing the description of the expansion of the size of simulated quantum systems and the noise propagation. This framework enables the general tree HTN states to be explicitly represented and their physicality to be discussed. We also show that the expectation value of a measured observable exponentially vanishes with the number of contracted quantum tensors. Our work will lead to providing the noise-resilient construction of HTN states.


  • Open Access

    Hardware-Efficient Bosonic Quantum Computing with Photon-loss Detection Capability

    by Yuichiro Mori, Yuichiro Matsuzaki, Suguru Endo, Shiro Kawabata

    Bosonic quantum systems offer the hardware-efficient construction of error detection/error correction codes by using the infinitely large Hilbert space. However, due to the encoding, arbitrary gate rotations usually require magic state teleportation or complicated optimized pulse sequences involving an ancilla qubit. Here, we propose a simple and hardware-efficient bosonic 02 error detection code that allows for the implementation of arbitrary X and Z rotations and a controlled phase gate by using a Kerr nonlinear resonator. Our code can detect a single photon loss, and we observe significant error suppression by simulating the frequently used hardware-efficient ansatz quantum circuit in near-term quantum computing.