activity
20172026
most citedGeneralized quantum subspace expansion

81 citations · 482 across the 29 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

quant-ph2023★ 1 cited

Quantum Circuit Unoptimization

Yusei Mori, Hideaki Hakoshima, Kyohei Sudo +3

Optimization of circuits is an essential task for both quantum and classical computers to improve their efficiency. In contrast, classical logic optimization is known to be difficu…

quant-ph2023★ 3 cited

Resource-efficient Generalized Quantum Subspace Expansion

Bo Yang, Nobuyuki Yoshioka, Hiroyuki Harada +5

Realizing practical quantum computing requires overcoming a number of computation errors and the limitation of device size, which have intensively been tackled by quantum error mit…

quant-ph2023★ 11 cited

Localized Virtual Purification

Hideaki Hakoshima, Suguru Endo, Kaoru Yamamoto +2

Analog and digital quantum simulators can efficiently simulate quantum many-body systems that appear in natural phenomena. However, experimental limitations of near-term devices st…

quant-ph2023★ 24 cited

A comprehensive survey on quantum computer usage: How many qubits are employed for what purposes?

Tsubasa Ichikawa, Hideaki Hakoshima, Koji Inui +18

Quantum computers (QCs), which work based on the law of quantum mechanics, are expected to be faster than classical computers in several computational tasks such as prime factoring…

quant-ph2023★ 11 cited

QAOA-MC: Markov chain Monte Carlo enhanced by Quantum Alternating Operator Ansatz

Yuichiro Nakano, Hideaki Hakoshima, Kosuke Mitarai +1

Quantum computation is expected to accelerate certain computational task over classical counterpart. Its most primitive advantage is its ability to sample from classically intracta…