Comfortably Quantum with Qrisp

What if you could implement Shor's algorithm in just 11 lines of code? Discover how Qrisp makes quantum programming feel as natural as Python.

#1about 5 minutes

Moving beyond quantum circuits to high-level variables

Traditional quantum circuit construction is complex and hinders collaboration, but a high-level variable-based approach simplifies code dramatically.

#2about 4 minutes

Using QuantumVariables and QuantumFloats for arithmetic

The QuantumVariable encapsulates qubits, enabling higher-level types like QuantumFloat which supports standard arithmetic operations out of the box.

#3about 3 minutes

Implementing logic with QuantumBools and comparisons

QuantumBool types enable logical operations and comparisons between quantum variables, which is crucial for building complex algorithmic logic.

#4about 2 minutes

Implementing Shor's algorithm with high efficiency

Qrisp's high-level abstractions allow for a compact implementation of Shor's algorithm that significantly outperforms other frameworks on key performance metrics.

#5about 2 minutes

Simulating molecular systems with the operators module

The operators module provides tools for defining Hamiltonians with creation and annihilation operators, simplifying the simulation of molecular ground state energies.

#6about 2 minutes

Overcoming compilation bottlenecks with JAX and QIR

Qrisp integrates with Google's JAX library to compile code through MLIR down to the Quantum Intermediate Representation (QIR) for efficient hybrid computation.

#7about 3 minutes

A practical quantum chemistry application walkthrough

A step-by-step code example demonstrates how to estimate the ground state energy of a hydrogen molecule using quantum phase estimation.

#8about 2 minutes

Using quantum environments for advanced control flow

Quantum environments provide high-level abstractions for implementing classical control flow, such as conditional operations and loops, without manual circuit construction.

#9about 2 minutes

Efficient qubit recycling with automatic uncomputation

Automatic uncomputation is a key feature that recycles ancillary qubits after use, leading to more sustainable and resource-efficient quantum programs.

#10about 5 minutes

Implementing the linear combination of unitaries primitive

The Linear Combination of Unitaries (LCU) is a powerful primitive for simulating complex systems, implemented concisely in Qrisp using control and conjugation environments.