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

数理解析研究所講究録

量子アルゴリズムを用いた多項式GCDの計算 (Computer Algebra : Algorithms, Implementations and Applications)

邦敬 武田, 博 甲斐, 松太郎 野田

Published Nov 1, 2002• 0 citations
OpenAlex

Related papers

算術演算を行う量子回路の構成 (Computer Algebra : Algorithms, Implementations and Applications)

昇 國廣

数理解析研究所講究録•Jul 1, 2003•0 citations

代数的アルゴリズムに対する量子計算 (Computer Algebra--Algorithms, Implementations and Applications 研究集会報告集)

邦敬 武田, 博 甲斐, 松太郎 野田

もし、 量子コンピュータが実現すれば、現在の IT 社会の根幹となっている暗号技術に大きな課題を投げか

数理解析研究所講究録•Jul 1, 2003•0 citations

ユーザ定義述語を含む系の限量子消去法 (Computer Algebra : Design of Algorithms, Implementations and Applications)

Fumio Motoyoshi, 澄孝 秋葉

数理解析研究所講究録•Sep 1, 2006•0 citations

Can Quantum Computers Solve Linear Algebra Problems to Advance Engineering Applications?

Guanglei Xu, William S. Oates

Since its inception by Richard Feynman in 1982, quantum computing has provided an intriguing opportunity to advance computational capabilities over classical computing. Classical computers use bits to process information in terms of zeros and ones. Quantum computers use the complex world of quantum mechanics to carry out calculations using qubits (the quantum analog of a classical bit). The qubit can be in a superposition of the zero and one state simultaneously unlike a classical bit. The true power of quantum computing comes from the complexity of entanglement between many qubits. When entanglement is realized, quantum algorithms for problems such as factoring numbers and solving linear algebra problems show exponential speed-up relative to any known classical algorithm. Linear algebra problems are of particular interest in engineering application for solving problems that use finite element and finite difference methods. Here, we explore quantum linear algebra problems where we design and implement a quantum circuit that can be tested on IBM’s quantum computing hardware. A set of quantum gates are assimilated into a circuit and implemented on the IBM Q system to demonstrate its algorithm capabilities and its measurement methodology.

ASME Conference on Smart Materials, Adaptive Structures and Intelligent Systems (SMASIS)•Sep 10, 2018•1 citation

Computerization and Computer Algebra

George Jaroszkiewicz

Cambridge University Press eBooks•Nov 28, 2017•0 citations

Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra

Charles Yuan

Quantum algorithms for computational linear algebra promise up to exponential speedups for applications such as simulation and regression, making them prime candidates for hardware realization. But these algorithms execute in a model that cannot efficiently store matrices in memory like a classical algorithm does, instead requiring developers to implement complex expressions for matrix arithmetic in terms of correct and efficient quantum circuits. Among the challenges for the developer is navigating a cost model in which conventional optimizations for linear algebra, such as subexpression reuse, can be inapplicable or unprofitable. In this work, we present Cobble, a language for programming with quantum computational linear algebra. Cobble enables developers to express and manipulate the quantum representations of matrices, known as block encodings, using high-level notation that automatically compiles to correct quantum circuits. Cobble features analyses that compute the time and space usage of programs, as well as optimizations that reduce overhead and generate efficient circuits using state-of-the-art techniques such as the quantum singular value transformation. We evaluate Cobble on benchmark kernels for simulation, regression, search, and other applications, showing 2.6x-25.4x speedups on these benchmarks compared to the unoptimized baseline.

cs.PLCross-listedarXiv:2511.01736•Proceedings of the ACM on Programming Languages•Nov 4, 2025•9 citations
Since its inception by Richard Feynman in 1982, quantum computing has provided an intriguing opportunity to advance computational capabilities over classical computing. Classical computers use bits to process information in terms of zeros and ones. Quantum computers use the complex world of quantum mechanics to carry out calculations using qubits (the quantum analog of a classical bit). The qubit can be in a superposition of the zero and one state simultaneously unlike a classical bit. The true power of quantum computing comes from the complexity of entanglement between many qubits. When entanglement is realized, quantum algorithms for problems such as factoring numbers and solving linear algebra problems show exponential speed-up relative to any known classical algorithm. Linear algebra problems are of particular interest in engineering application for solving problems that use finite element and finite difference methods. Here, we explore quantum linear algebra problems where we design and implement a quantum circuit that can be tested on IBM’s quantum computing hardware. A set of quantum gates are assimilated into a circuit and implemented on the IBM Q system to demonstrate its algorithm capabilities and its measurement methodology.
Quantum algorithms for computational linear algebra promise up to exponential speedups for applications such as simulation and regression, making them prime candidates for hardware realization. But these algorithms execute in a model that cannot efficiently store matrices in memory like a classical algorithm does, instead requiring developers to implement complex expressions for matrix arithmetic in terms of correct and efficient quantum circuits. Among the challenges for the developer is navigating a cost model in which conventional optimizations for linear algebra, such as subexpression reuse, can be inapplicable or unprofitable. In this work, we present Cobble, a language for programming with quantum computational linear algebra. Cobble enables developers to express and manipulate the quantum representations of matrices, known as block encodings, using high-level notation that automatically compiles to correct quantum circuits. Cobble features analyses that compute the time and space usage of programs, as well as optimizations that reduce overhead and generate efficient circuits using state-of-the-art techniques such as the quantum singular value transformation. We evaluate Cobble on benchmark kernels for simulation, regression, search, and other applications, showing 2.6x-25.4x speedups on these benchmarks compared to the unoptimized baseline.