output
20192026
most citedGW250114: testing Hawking's area law and the Kerr nature of black holes

100 citations

Showing quant-phShow all

13 papers · 1 filter

quant-ph2026★ 1 cited

Concatenated continuous driving of silicon qubit by amplitude and phase modulation

Takuma Kuno, Takeru Utsugi, Andrew J. Ramsay +22

The rate of coherence loss is lower for a qubit under the Rabi drive than a freely evolving qubit . Building on this principle, concatenated continuous d…

quant-ph2026

Breaking the Orthogonality Barrier in Quantum LDPC Codes

Kenta Kasai

Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well…

quant-ph2025

Quantum reservoir computing for predicting and characterizing chaotic maps

Qingyu Li, Chiranjib Mukhopadhyay, Ludovico Minati +1

Quantum reservoir computing has emerged as a promising paradigm for harnessing quantum systems to process temporal data efficiently by bypassing the costly training of gradient-bas…

quant-ph2025

Matrix-product-state approach for qubits-waveguide systems in real space

Shimpei Goto

We present a matrix-product-state-based numerical approach for simulating systems composed of several qubits and a common one-dimensional waveguide. In the presented approach, the…

quant-ph2025★ 10 cited

Phase Transitions in Nonreciprocal Driven-Dissipative Condensates

Ron Belyansky, Cheyne Weis, Ryo Hanai +2

We investigate the influence of boundaries and spatial nonreciprocity on nonequilibrium driven-dissipative phase transitions. We focus on a one-dimensional lattice of nonlinear bos…

quant-ph2025★ 1 cited

Transfer Learning for Deep-Unfolded Combinatorial Optimization Solver with Quantum Annealer

Ryo Hagiwara, Shunta Arai, Satoshi Takabe

Quantum annealing (QA) has attracted research interest as a sampler and combinatorial optimization problem (COP) solver. A recently proposed sampling-based solver for QA significan…

quant-ph2024★ 3 cited

Subgradient Method using Quantum Annealing for Inequality-Constrained Binary Optimization Problems

Taisei Takabayashi, Takeru Goto, Masayuki Ohzeki

Quantum annealing is a generic solver for combinatorial optimization problems that utilizes quantum fluctuations. Recently, there has been extensive research applying quantum annea…

quant-ph2024★ 1 cited

Cancellation of phonon hopping in trapped ions by modulation of the trap potential

Takanori Nishi, Kaoru Yamanouchi, Ryoichi Saito +1

The local modes of trapped ions can be used to construct an analog quantum simulator and a digital quantum computer. However, the control of the phonon hopping remains difficult be…

quant-ph2024★ 3 cited

Deep Unfolded Local Quantum Annealing

Shunta Arai, Satoshi Takabe

Local quantum annealing (LQA), an iterative algorithm, is designed to solve combinatorial optimization problems. It draws inspiration from QA, which utilizes adiabatic time evoluti…

quant-ph2024★ 2 cited

Labeling eigenstates of qubit-cavity systems based on the continuity of qubit occupancy: Detecting resonances to higher excited qubit states

Shimpei Goto, Kazuki Koshino

We propose a new method for labeling the eigenstates of qubit-cavity systems based on the continuity of the qubit occupancy. The labeled eigenstates give a rough estimate of the ev…

quant-ph2024

Universal scaling hypothesis of quantum spatial search in complex networks

Rei Sato, Tetsuro Nikuni, Kayoko Nohara +2

Since quantum spatial searches on complex networks have a strong network dependence, the question arises whether the universal perspective exists in this quantum algorithm for comp…

quant-ph2023★ 5 cited

Kernel Learning by quantum annealer

Yasushi Hasegawa, Hiroki Oshiyama, Masayuki Ohzeki

The Boltzmann machine is one of the various applications using quantum annealer. We propose an application of the Boltzmann machine to the kernel matrix used in various machine-lea…

quant-ph2021★ 5 cited

Graph minor embedding can affect sampling degenerate ground states using quantum annealing

Naoki Maruyama, Masayuki Ohzeki, Kazuyuki Tanaka

Quantum annealing, as currently implemented in hardware, cannot fairly sample all ground states. Graph minor embedding, which maps a problem to the hardware graph of quantum anneal…