vsergeyev GitHub avatar

qml-summer-school-2026-haiqu-ucu

vsergeyev

一个概念验证项目,应用舒马赫量子压缩到DNA序列,将量子比特需求减少35%,同时保持99%的重建保真度。

Stars

6

7 天增长

暂无数据

Fork 数

0

开放 Issue

0

开源协议

Apache-2.0

最近更新

2026-07-30

AI 仓库情报摘要
FR-AI / ANALYSIS

为什么值得关注

它展示了量子信息理论在解决基因组规模量子计算中量子比特稀缺问题的实际应用,并通过独立验证确认了结果。

适合谁使用

  • 研究数据压缩技术的量子计算研究人员
  • 探索基因组数据量子方法的生物信息学专家
  • 寻求高效编码方法的量子机器学习从业者
  • 使用具体示例演示舒马赫压缩的教育工作者

典型使用场景

  • 减少对DNA序列进行运算的量子算法所需的量子比特数
  • 在有限硬件资源下实现量子基因组搜索
  • 作为基因组数据量子压缩的基准或参考
  • 在真实数据上演示舒马赫定理的教育示例

项目优势

  • 在模拟中实现35%的量子比特减少和99%的重建保真度
  • 基于严格的理论基础(舒马赫压缩、冯·诺依曼熵)
  • 通过三种独立验证方法确认,保真度匹配到六位小数
  • 通过重叠量子态提供可调压缩,平衡量子比特节省和可区分性

使用前须知

  • 假设DNA碱基独立同分布(i.i.d.),忽略了经典压缩工具利用的长程相关性
  • 更高的压缩以编码碱基之间可区分性降低为代价
  • 不是经典的DNA压缩器;仅解决量子数据的量子比特占用,而非整体存储效率

README 快速开始

Compressing DNA to its Quantum Entropy Limit

Quantum Machine Learning Hackathon 2026 project
Applying Schumacher quantum compression to DNA sequences to reduce qubit requirements for quantum genomic algorithms.


Overview

Current quantum computers are severely limited by the number of available qubits. While a classical DNA base requires only two bits, storing genomic data as quantum information quickly becomes infeasible at genome scale.

This project explores whether Schumacher quantum data compression can reduce the number of qubits required to represent DNA while preserving quantum fidelity.

Instead of treating DNA bases as perfectly distinguishable quantum states, we encode them as non-orthogonal quantum states, allowing compression toward the von Neumann entropy limit.

The result is a proof-of-concept implementation demonstrating that quantum compression can significantly reduce qubit requirements while maintaining high recovery fidelity.


Motivation

A human genome contains roughly:

  • 3.2 billion DNA bases
  • Naïve quantum encoding:
    • 2 qubits per base
    • 6.4 billion qubits

Today's gate-model quantum computers typically contain only 10²–10³ qubits.

Every qubit matters.


Key Idea

Schumacher's theorem is the quantum analogue of Shannon's source coding theorem.

For a quantum source with density matrix ρ, the optimal asymptotic compression rate is

[ S(\rho)=-\mathrm{Tr}(\rho\log_2\rho) ]

where S(ρ) is the von Neumann entropy.

Instead of storing every basis state independently, we:

  1. Encode DNA bases as quantum states
  2. Construct the density matrix
  3. Project onto the typical subspace
  4. Store only the compressed quantum state
  5. Recover the original state with fidelity approaching 1

Pipeline

DNA sequence
      │
      ▼
Quantum Encoding
      │
      ▼
Density Matrix
      │
      ▼
Typical Subspace Projection
      │
      ▼
Compressed Quantum Register
      │
      ▼
Quantum Reconstruction

Encoding Strategies

Classical (Orthogonal)

A
C
G
T

Each base is perfectly distinguishable.

Compression is minimal.


Quantum (Non-Orthogonal)

Bases are represented by overlapping Bloch sphere states.

Advantages:

  • lower von Neumann entropy
  • fewer qubits required
  • tunable overlap angle

Tradeoff:

  • bases become harder to disting

项目描述

Quantum Machine Learning School 2026: Project - Compressing DNA to its quantum entropy limit.

相关仓库与替代方案

根据分类、Topic 和编程语言匹配的相似项目。

lopopolo
精选
lopopolo GitHub avatar

harness-engineering

Harness Engineering is a methodology for improving coding agent outputs by carefully crafting the environment around them—providing curated context, tools, and executable constraints that encode an organization’s nonfunctional requirements and cumulative lessons.

AI 与机器学习AI 智能体
2,390
slvDev
精选
slvDev GitHub avatar

esp32-ai

A 28.9 million parameter language model runs on an $8 ESP32-S3 microcontroller entirely on-device, generating simple stories at about 9.5 tokens per second.

AI 与机器学习大语言模型
1,960
littledivy
精选
littledivy GitHub avatar

mimic

mimic captures traffic from any iOS or web app and automatically generates a Python client library that lets you call the app's API like a regular library.

AI 与机器学习
1,482