Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A Solution of Quantum Estimation Problem Using Quantum Error-Correcting Codes and Its Applications

M. Yoshida

Published Feb 17, 2014• 0 citations
OpenAlex

Abstract

【学位授与の要件】中央大学学位規則第4条第1項 【論文審査委員主査】今井 秀樹(中央大学理工学部教授) 【論文審査委員副査】趙 晋輝(中央大学理工学部教授)、築山 修治(中央大学理工学部教授)、今福 健太郎(産業技術総合研究所主任研究員)

Related papers

A solution of quantum estimation problem using quantum error-correcting codes and its applications

雅一 吉田

•Jan 1, 2013•0 citations

Research on the interaction between atoms and a dielectric surface by precise manipulation of cold atoms

Taro Mashimo

【学位授与の要件】中央大学学位規則第4条第1項 【論文審査委員主査】東條 賢(中央大学理工学部教授) 【論文審査委員副査】土屋 俊二(中央大学理工学部准教授)、脇田 順一(中央大学理工学部教授)、庄司 一郎(中央大学理工学部教授)、畠山 温(東京農工大学大学院教授)

•Oct 13, 2021•0 citations

An Overview of Quantum Algorithms

Seiichiro Tani

量子コンピュータは,量子力学の原理を用いて計算を行うコンピュータであり,現在のコンピュータを超える計算能力を発揮することが期待されている.そのためには,量子コンピュータのハードウェアを効果的に使って計算を行うアルゴリズム(量子アルゴリズム)が必要となる.本稿では,これまで行われてきた量子アルゴリズム研究を概観し,課題と展望について議論する

Denshi Jouhou Tsuushin Gakkai Tsuushin Sosaieti magajin/B-plus/Denshi Jouhou Tsuushin Gakkai Tsuushin Sosaeti magajin•Jan 1, 2020•0 citations

Solution to the mean king's problem using quantum error-correcting codes

M. Yoshida, Gen Kimura, Takayuki Miyadera +2 more

We discuss the so-called mean king's problem, a retrodiction problem among noncommutative observables, in the context of error detection. Describing the king's measurement effectively by a single error operation, we give a solution of the mean king's problem using quantum error-correcting codes. The existence of a quantum error-correcting code from a solution is also presented.

arXiv:1507.07072•Physical Review A•May 26, 2015•5 citations

Satisfying Quantum Codes: Physics-Informed and Hardware-Aware Code Design with SAT Solvers

Ben DalFavero, William M. Watkins, Margarite L. LaBorde +4 more

Although quantum error correction is widely believed to be necessary for impactful applications of quantum computers, the design of quantum error correction codes is largely done by hand, without respect to problem or hardware constraints. In this work, we present a highly general and flexible framework for the computational design of both physics-inspired and hardware-aware quantum codes. To do so, we formulate code design as a Boolean satisfiability (SAT) problem and show how to incorporate all required error correction criteria. We prove that code design is NP-complete, ruling out any efficient algorithm for designing codes in general. Nonetheless, we show that state-of-the-art SAT solvers are able to effectively find solutions for many practical problems. Notably, we are able to design physics-inspired codes with up to 100 physical qubits in minutes, and we design new hardware-aware codes for biased noise which have a lower logical error rate than state-of-the-art surface codes.

quant-pharXiv:2608.23460•Aug 25, 2026•0 citations

A survey on quantum error correcting codes

황규호

•Jan 1, 2018•0 citations
【学位授与の要件】中央大学学位規則第4条第1項 【論文審査委員主査】今井 秀樹(中央大学理工学部教授) 【論文審査委員副査】趙 晋輝(中央大学理工学部教授)、築山 修治(中央大学理工学部教授)、今福 健太郎(産業技術総合研究所主任研究員)
量子コンピュータは,量子力学の原理を用いて計算を行うコンピュータであり,現在のコンピュータを超える計算能力を発揮することが期待されている.そのためには,量子コンピュータのハードウェアを効果的に使って計算を行うアルゴリズム(量子アルゴリズム)が必要となる.本稿では,これまで行われてきた量子アルゴリズム研究を概観し,課題と展望について議論する
Although quantum error correction is widely believed to be necessary for impactful applications of quantum computers, the design of quantum error correction codes is largely done by hand, without respect to problem or hardware constraints. In this work, we present a highly general and flexible framework for the computational design of both physics-inspired and hardware-aware quantum codes. To do so, we formulate code design as a Boolean satisfiability (SAT) problem and show how to incorporate all required error correction criteria. We prove that code design is NP-complete, ruling out any efficient algorithm for designing codes in general. Nonetheless, we show that state-of-the-art SAT solvers are able to effectively find solutions for many practical problems. Notably, we are able to design physics-inspired codes with up to 100 physical qubits in minutes, and we design new hardware-aware codes for biased noise which have a lower logical error rate than state-of-the-art surface codes.