`unitary()`: project nearly-unitary matrices onto the closest unitary

未关闭
#21 0 条评论 0 个 reaction 已指派 0 人 在 GitHub 查看

还没有人认领这个 Issue。

评估

难度
4/5
预计耗时
3-5 天
新手友好度
55/100
Issue 类型
缺陷
描述清晰度
描述清楚
活跃度
活跃
技术栈
rust
领域
backend

调研方向

Start by reading src/circuit.rs around line 144 to see how unitary() checks matrices and how it represents them. The issue suggests projecting accepted matrices with a polar decomposition or one Newton step; confirm the available matrix operations and relevant tests before choosing an approach. Done means accepted nearly-unitary matrices are projected to the closest unitary without changing the API.

由索引模型根据 Issue 内容生成。

描述

enhancement
What you want to do

unitary() accepts matrices that are up to 1e-9 away from unitary (src/circuit.rs:144) and uses them
as given. Each such gate scales the norm by up to 1 ± 1e-9, which adds up over long circuits.

Implementation notes

After the check passes, replace U with its closest unitary, U·(U†U)^(−1/2). For 2×2 that's a
closed-form polar decomposition, or a single Newton step U ← ½(U + U^{−†}), which is enough at
this tolerance.

What it could look like
No API change.
Contributing
  • I would like to open a pull request for this (see CONTRIBUTING.md).
主要语言
Rust
星标
1
派生
0
平均合并
12 分钟
30 天内合并 PR
4

环境准备

  • 没有 Dockerfile 或 Docker Compose 文件
  • 没有 Pull Request 模板
  • 阅读贡献指南

从这里开始

  1. 先读完整个 Issue,再读项目的贡献指南。
  2. 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
  3. Fork 仓库,在一个分支上完成修改。
  4. 提交 Pull Request,并在描述里引用这个 Issue 编号。

kaiwave/qsengine 的其他 Issue

查看 kaiwave/qsengine 的全部 Issue

相似的 Issue

更多 Rust Issue

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。