vsergeyev GitHub avatar

qml-summer-school-2026-haiqu-ucu

vsergeyev

A proof-of-concept project that applies Schumacher quantum compression to DNA sequences, reducing qubit requirements by 35% while maintaining 99% reconstruction fidelity.

Stars

6

7-day growth

No data

Forks

0

Open issues

0

License

Apache-2.0

Last updated

2026-07-30

AI repository intelligence
FR-AI / ANALYSIS

Why it is worth attention

It demonstrates a practical application of quantum information theory to address the qubit scarcity problem in genomic-scale quantum computing, with independent validation of results.

Who it is for

  • Quantum computing researchers investigating data compression techniques
  • Bioinformaticians exploring quantum approaches to genomic data
  • Quantum machine learning practitioners seeking efficient encoding methods
  • Educators demonstrating Schumacher compression with a concrete example

Use cases

  • Reducing qubit requirements for quantum algorithms that operate on DNA sequences
  • Enabling quantum genomic searches with limited hardware resources
  • Serving as a benchmark or baseline for quantum data compression in genomics
  • Educational demonstrations of Schumacher's theorem on real-world data

Strengths

  • Achieves 35% qubit reduction with 99% reconstruction fidelity in simulation
  • Uses a rigorous theoretical foundation (Schumacher compression, von Neumann entropy)
  • Validated by three independent verification methods with matching fidelity to six decimal places
  • Offers tunable compression via overlapping quantum states, balancing qubit savings and distinguishability

Considerations

  • Assumes DNA bases are independent and identically distributed (i.i.d.), ignoring long-range correlations exploited by classical compressors
  • Increased compression comes at the cost of reduced distinguishability between encoded bases
  • Not a classical DNA compressor; only addresses qubit footprint of quantum data, not overall storage efficiency

README quick start

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

Description

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

Related repositories

Similar projects matched by category, topics, and programming language.

lopopolo
Featured
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 & Machine LearningAI Agents
2,390
slvDev
Featured
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 & Machine LearningLarge Language Models
1,960
littledivy
Featured
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 & Machine Learning
1,482