Tutorials
Luna streamlines access to quantum computing by handling backend complexity for you. This section provides step-by-step tutorials for using supported quantum backends with LunaSolve and LunaQ. You'll find clear guidance, usage examples, and links to relevant resources—everything needed to effectively use Luna in real-world scenarios.
The Use Case section provides tutorials using our Use Case Library, making it easy to solve standard optimization problems.
Getting Started
-
Solve Your First Optimization Problem
Get started with solving a Traveling Salesperson Problem with QAOA using Simulator and QPU.
-
Solve a QUBO with Our QAGA+ Algorithm
Use our innovative QAGA+ algorithm that uses D-Wave's annealers to solve a QUBO.
Use Cases
-
Set Partitioning
Divide a universal set into non-overlapping subsets that cover every element exactly once.
-
Set Packing
Select the maximum number of non-overlapping subsets from a collection of sets.
-
Hamiltonian Cycle
Find a cycle that visits every vertex of a graph exactly once and returns to the start.
-
Longest Path
Find the longest simple path between two vertices in a graph.
-
Max Clique
Find the largest complete subgraph within a given graph.
-
Max Cut
Partition graph nodes into two groups to maximize edges between them.
-
Max Independent Set
Find the largest set of vertices with no two adjacent in a graph.
-
Minimum Vertex Cover
Find the smallest set of vertices that covers every edge in a graph.
