12 citations · 12 across the 1 of their papers we have counts for
4 papers · 1 filter
Approximate Solutions of Combinatorial Problems via Quantum Relaxations
Bryce Fuller, Charles Hadfield, Jennifer R. Glick +8
Combinatorial problems are formulated to find optimal designs within a fixed set of constraints. They are commonly found across diverse engineering and scientific domains. Understa…
Scheduling of Operations in Quantum Compiler
Toshinari Itoko, Takashi Imamichi
When scheduling quantum operations, a shorter overall execution time of the resulting schedule yields a better throughput and higher fidelity output. In this paper, we demonstrate…
Efficient evaluation of quantum observables using entangled measurements
Ikko Hamamura, Takashi Imamichi
The advent of cloud quantum computing has led to the rapid development of quantum algorithms. In particular, it is necessary to study variational quantum-classical hybrid algorithm…
Optimization of Quantum Circuit Mapping using Gate Transformation and Commutation
Toshinari Itoko, Rudy Raymond, Takashi Imamichi +1
This paper addresses quantum circuit mapping for Noisy Intermediate-Scale Quantum (NISQ) computers. Since NISQ computers constraint two-qubit operations on limited couplings, an in…