---
title: 'ClusterVQE: Hybrid Quantum Clustering'
url: https://www.emergentmind.com/topics/clustervqe
type: topic
---

# ClusterVQE: Hybrid Quantum Clustering

ClusterVQE refers to a family of quantum algorithms and quantum-inspired hybrid schemes leveraging the variational quantum eigensolver (VQE) in combination with data or qubit clustering to efficiently solve unsupervised learning and quantum chemistry problems on resource-limited hardware. These approaches employ iterative minimization of a cost Hamiltonian reflecting the target partitioning or molecular ground state, while exploiting cluster-based decompositions—of datapoints, qubits, or operator structure—to reduce circuit or device requirements. Supported by a range of implementations, ClusterVQE encompasses both data-driven clustering (e.g., k-means, MaxCut) and physics-motivated qubit-clustering for electronic structure [2206.09893][2106.07619][2305.04425][2312.03516][2402.01529][2112.03199][1701.02691].

## 1. Mathematical Formalism and Problem Mappings

ClusterVQE attempts to encode a global optimization—such as clustering $N$ datapoints into $k$ classes, or finding the ground state of an $N$-qubit molecular Hamiltonian—into a quantum or quantum-inspired cost function amenable to variational simulation.

### Data Clustering via Hamiltonians

Given feature vectors $\vec{x}_i \in \mathbb{R}^m$ and $k$ clusters, the classical assignment cost is typically expressed as
\[
H_{\rm classical} = \frac{1}{2} \sum_{i,j=1}^N d(\vec{x}_i, \vec{x}_j) \sum_{a=1}^k q_i^a q_j^a
\]
with $\sum_{a=1}^k q_i^a = 1$ enforcing the one-hot constraint. Mapped to a quantum setting, this becomes
\[
H_c = \sum_{i<j} \sum_{a=1}^k d(\vec{x}_i, \vec{x}_j) \ |\psi^a\rangle\langle\psi^a|_i \otimes |\psi^a\rangle\langle\psi^a|_j
\]
where $\{|\psi^a\rangle\}$ are maximally-orthogonal label reference states in the $2^n$-dimensional Hilbert space [2206.09893].

For binary clustering (MAXCUT), the assignment reduces to an Ising Hamiltonian,
\[
H_{\mathrm{cut}} = \sum_{i<j} w_{ij} \frac{1-Z_i Z_j}{2}
\]
with $w_{ij}$ a weighted adjacency or distance matrix and $Z_i$ the Pauli $Z$ operator [2112.03199][2312.03516][2402.01529].

### Quantum Chemistry with Clustered Qubits

In molecular VQE, the unitary coupled cluster (UCC) ansatz or variants is employed. ClusterVQE partitions the $N$-qubit system into $M$ clusters ${\mathcal C}_p$, based on quantum mutual information $I_{ij}$ to maximize intra-cluster entanglement and minimize inter-cluster coupling [2106.07619]. The wavefunction is represented as a tensor product of cluster states, and the full Hamiltonian is "dressed" to capture inter-cluster correlations:
\[
H_d = \Bigl(\prod_{p\neq q} U_{pq}^\dagger\Bigr) H \Bigl(\prod_{p\neq q} U_{pq}\Bigr)
\]
with $U_{pq}$ unitaries connecting clusters $p$ and $q$.

## 2. Quantum Circuit Architectures and Computational Strategies

### Data Mapping and Label-State Encoding

Data vectors are mapped to quantum states via feature map circuits, such as sequences of $R_z$, $R_y$ rotations, distributing features over $2n$ rotation angles for $n$ qubits. Labels are not restricted to computational basis vectors; rather, one uses maximally mutually orthogonal states, e.g., the four Bloch sphere tetrahedron vertices for up to $k=4$ clusters with $n=1$ qubit [2206.09893].

### Clustered Circuit Schemes

ClusterVQE reduces circuit depth and device width by distributing the problem over smaller subcircuits:

- In quantum chemistry, each cluster simulation employs a shallower ansatz (e.g., hardware-efficient, UCC, or modular cluster circuits), avoiding large-width entanglers and limiting inter-cluster unitaries to classical pre/post-processing [2106.07619][2305.04425].
- In data clustering, circuits prepare the parameterized trial state, with data-mapped rotations followed by a layer of CNOTs for entanglement. For coreset-based approaches, the number of qubits $m$ matches the coreset size [2402.01529][2312.03516].

## 3. Workflow: Optimization and Measurement

The variational workflow common to all implementations proceeds as:

1. **Hamiltonian Construction**: Encode cost function as a qubit Hamiltonian (clustering cost, MAXCUT, UCC or dressed Hamiltonian).
2. **Ansatz Initialization**: Construct parameterized trial circuits (e.g., hardware-efficient, modular cluster, UCCSD).
3. **Classical Optimization**: Apply optimizers such as Adam, SPSA, COBYLA, or SLSQP to minimize energy expectation $\langle H \rangle$ with respect to the variational parameters.
4. **Energy and Gradient Measurement**: Measure and average Pauli-term expectations via shot-based sampling; analytic gradient computation is enabled through dressed operators or Hadamard-test–like subcircuits [1701.02691][2106.07619].
5. **Cluster Assignment or State Reconstruction**: For clustering, assign classes via maximal label-state fidelity or output bitstring; for chemistry, extract optimized waveform and ground-state energy.

Optionally, error mitigation is applied via zero-noise extrapolation or Clifford-data regression [2206.09893][2106.07619].

## 4. Quantum-Inspired and Coreset Techniques

Classical simulability and data size reduction are key to making ClusterVQE practical on current devices:

- **Tensor Network Simulation**: In [2206.09893], the variational circuit is chosen so that the state of each data point is a Matrix Product State (MPS) of bond dimension $\chi \leq 2$, enabling efficient gradient-based or imaginary-time optimization entirely classically ("quantum-inspired clustering").
- **Coreset Reduction**: To handle large datasets, a classical $\epsilon$-coreset (weighted data subset) is constructed, and only the m-point coreset is mapped to a quantum Hamiltonian [2402.01529][2312.03516]. Quantum-tailored coresets, such as the deterministic "Contour coreset," are specifically designed to avoid missing minority clusters in small $m$ [2312.03516].
- **Resource Scaling**: With clustering, the quantum resource load (qubits, circuit depth) scales with coreset cardinality, permitting larger classical datasets to be processed by small quantum devices.

## 5. Numerical Results and Empirical Performance

### Benchmarks in Data Clustering

- **Clustering Accuracy**: On the Iris dataset (n=1 qubit, k=3 clusters), ClusterVQE achieves 96% accuracy in 15–20 epochs using the Adam optimizer [2206.09893].
- **Coreset-Based VQE**: The VQE+Contour coreset approach shows superior average accuracy and lower standard deviation compared to QAOA+generic coreset for Iris, Wine, Breast Cancer, and uneven synthetic benchmarks (e.g., Iris: 0.914±0.012 vs 0.896±0.035) [2312.03516].
- **Hardware Demonstrations**: For 5–6 point clusters on IBM Q hardware, VQE approaches optimal solutions but occasionally fails to find the ground state, while warm-start QAOA produces exact results in shorter wall-clock time [2112.03199].

### Quantum Chemistry

- **Ground-State Energies**: LiH and N₂ simulations indicate that ClusterVQE matches the convergence of qubit-ADAPT-VQE but with fewer qubits, substantially reduced depth, and slower Pauli growth than iQCC [2106.07619].
- **Efficient Modular Circuits**: The modular 2-qubit cluster circuitry constructs $n$-qubit ansätze with depth $O(n)$ (e.g., depth 13–17 for 6 qubits vs. $\sim$100 for ADAPT-VQE/UCCSD), attaining chemical accuracy ($\Delta E_c < 10^{-3}$) on small molecules and Ising models [2305.04425].
- **Resource Estimates**: Use of MP2 screening and active space truncation cuts parameter and measurement budgets by over an order of magnitude with no significant loss in target accuracy [1701.02691].

## 6. Extensions, Limitations, and Future Directions

ClusterVQE techniques are extensible across both quantum unsupervised learning and correlated-electron physics:

- **Scalability**: Scaling beyond $k=2$ clusters for data is possible using general position label states or multi-qubit encodings, with qubit number scaling as $k$ or $k \log N$, and coresets providing a tractable route for large $N$ [2402.01529].
- **Measurement Overhead**: For coreset-based clustering, Hamiltonian term count is $O(m^2)$; mitigation via Pauli grouping and shadow tomography is suggested for near-term devices.
- **Unsolved Theoretical Problems**: For some quantum-tailored coresets, worst-case approximation guarantees are not yet established [2312.03516]. Clustering for $k > 2$ with qutrits or higher-dimensional encodings is open.
- **Noise and Error Mitigation**: Shallow, parallelizable circuits and error mitigation protocols are critical for NISQ device feasibility [2206.09893][2106.07619][2305.04425].
- **Hybrid Adaptive Methods**: Integration of adaptive ansatz growth (e.g., ADAPT-VQE) and natural-gradient preconditioning may alleviate barren plateaus and accelerate convergence in high-dimensional parameter spaces [2402.01529].

## 7. Comparison of ClusterVQE Implementations

| Variant                                 | Application Domain     | Quantum Resource Scaling | Classical Preprocessing          |
|------------------------------------------|-----------------------|-------------------------|----------------------------------|
| Data-driven ClusterVQE ([2206.09893])    | Clustering (k ≥ 2)    | $n = \log_2 k$ qubits   | Precompute distances, label states |
| Coreset-VQE ([2312.03516][2402.01529])   | Clustering, Big Data  | $m$ qubits (coreset)    | Coreset construction, Hamiltonian assembly |
| Qubit-ClusterVQE ([2106.07619])          | Quantum chemistry     | $N/M$ qubits (per cluster) | Mutual information, graph partitioning, Hamiltonian dressing |
| Modular Cluster Circuits ([2305.04425])  | Quantum chemistry/TFIM| $n$ qubits, depth $O(n)$| Valence bond tiling, circuit templating |

The ClusterVQE paradigm enables variational quantum and quantum-inspired algorithms for clustering and correlated systems to be applied efficiently on near-term hardware. This is achieved through hybridization of classical clustering (in data or qubit space), local circuit designs, and cost function strategies, as well as through data reduction (coresets) and tensor network simulation [2206.09893][2106.07619][2305.04425][2312.03516][2402.01529][2112.03199][1701.02691].

Source: https://www.emergentmind.com/topics/clustervqe