Publications (58)
Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era
Zichang He, Ruslan Shaydulin, Dylan Herman +4
Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum heuristics for combinatorial optimization. While QAOA has been shown to perform well on small…
Optimizing Parameterized Quantum Circuits with Free-Axis Selection
Hiroshi C. Watanabe, Rudy Raymond, Yu-ya Ohnishi +2
Variational quantum algorithms, which utilize Parametrized Quantum Circuits (PQCs), are promising tools to achieve quantum advantage for optimization problems on near-term quantum…
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…
Efficient implementation of randomized quantum algorithms with dynamic circuits
Shu Kanno, Ikko Hamamura, Rudy Raymond +2
Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their ext…
Amplitude estimation via maximum likelihood on noisy quantum computer
Tomoki Tanaka, Yohichi Suzuki, Shumpei Uno +3
Recently we find several candidates of quantum algorithms that may be implementable in near-term devices for estimating the amplitude of a given quantum state, which is a core sub-…
Quantum Network Coding
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura +2
Since quantum information is continuous, its handling is sometimes surprisingly harder than the classical counterpart. A typical example is cloning; making a copy of digital inform…