Projector Variational Ansatz (PVA) methodology for VQE that bridges NISQ variational and FTQC algorithm structures. Combines shallow ansatz depth with projector-based ground state identification.
Scanned 9/11/2026
Install to Claude Code
npx -y skills add hiyenwong/ai_collection --skill projector-variational-ansatz --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of Projector Variational Ansatz?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-projector-variational-ansatz)More formats (shields.io, HTML) on the badges page.
---
name: projector-variational-ansatz
description: "Projector Variational Ansatz (PVA) methodology for VQE that bridges NISQ variational and FTQC algorithm structures. Combines shallow ansatz depth with projector-based ground state identification."
category: quantum
---
# Projector Variational Ansatz (PVA)
## Description
Projector Variational Ansatz (PVA) methodology from arXiv:2606.07084 (June 2026). Proposes a VQE ansatz whose structure is more similar to Fault-Tolerant Quantum Computing (FTQC) algorithms. Unlike standard VQE which constructs state transitions directly, PVA constructs a projector that identifies the ground state using ancillary qubits that flag the good solution. Depending on parametrization, equivalent to either Intermediate Scale Quantum-QSP (ISQ-QSP) or ADAPT-VQE quantum circuit structure. Converges with shallower ansatz depth than standard ADAPT-VQE.
## Activation Keywords
- projector variational ansatz
- PVA VQE
- projector VQE
- FTQC variational bridge
- shallow VQE ansatz
- 投影变分拟设
- ADAPT-VQE 改进
## Tools Used
- terminal: Run quantum circuit simulations and quantum SDK commands
- read_file: Read quantum circuit definitions and ansatz specifications
- search_files: Search for existing VQE implementations
## Core Concepts
### FTQC vs VQE Paradigm Gap
- **FTQC algorithms** (QPE, QSP): Do not construct state transition directly; construct a projector that identifies ground state via ancillary qubits; use amplitude amplification or post-selection
- **VQE algorithms**: Search for parametrized unitary matrix (ansatz) to transform initial state to ground state; ADAPT-VQE constructs ansatz iteratively for shallow circuits
- **PVA bridges both**: VQE ansatz structured like FTQC projector, gaining benefits of both paradigms
### PVA Architecture
1. **Projector-based ansatz**: Instead of unitary evolution, constructs operator that projects onto target subspace
2. **Ancillary qubit flagging**: Uses ancilla qubits to flag good solutions (like FTQC)
3. **Parametric flexibility**:
- One parametrization → equivalent to ISQ-QSP
- Another parametrization → equivalent to ADAPT-VQE
4. **Shallower convergence**: Requires fewer circuit layers than ADAPT-VQE for same accuracy
### Mathematical Framework
- Ansatz operator: P(θ) = Π_k U_k(θ_k) where U_k are parametrized gates
- Objective: minimize ⟨ψ_0|P†(θ)HP(θ)|ψ_0⟩ / ⟨ψ_0|P†(θ)P(θ)|ψ_0⟩
- Ancilla measurement: projective measurement on ancilla registers determines success
## Usage Patterns
### Pattern 1: Shallow VQE Optimization
When standard ADAPT-VQE requires too many iterations/layers:
1. Replace ADAPT-VQE unitary ansatz with PVA projector ansatz
2. Parametrize as projector operators with ancillary flagging
3. Use amplitude amplification instead of post-selection for better convergence
4. Benchmark circuit depth vs ADAPT-VQE baseline
### Pattern 2: ISQ-QSP Implementation
When implementing Quantum Signal Processing on intermediate-scale hardware:
1. Map PVA parametrization to ISQ-QSP form
2. Use PVA's variational optimization to find optimal QSP angles
3. Benefit from variational flexibility while maintaining QSP structure
### Pattern 3: Hamiltonian Ground State Search
For computing ground states of problem Hamiltonians:
1. Prepare easy initial state |ψ_0⟩
2. Construct PVA ansatz P(θ) with projector structure
3. Optimize θ variationally to minimize energy expectation
4. Use ancilla flagging to verify ground state identification
## Instructions for Agents
### Step 1: Problem Formulation
- Identify the Hamiltonian H for which ground state is needed
- Determine if problem is in NISQ regime (shallow circuits) or near-FTQC regime
- Assess whether ADAPT-VQE circuit depth is a bottleneck
### Step 2: Ansatz Selection
- If shallow circuits needed → use PVA with ISQ-QSP parametrization
- If iterative construction preferred → use PVA with ADAPT-VQE-like parametrization
- Compare expected circuit depth against standard ADAPT-VQE
### Step 3: Circuit Implementation
- Implement projector-based ansatz using quantum SDK (Qiskit, PennyLane, Cirq)
- Add ancillary qubits for flagging mechanism
- Implement measurement-based verification of solution quality
### Step 4: Optimization
- Use classical optimizer (COBYLA, SPSA, L-BFGS-B) for parameter optimization
- Track convergence rate vs ADAPT-VQE baseline
- Monitor circuit depth and gate count
## Error Handling
- **Shallow ansatz insufficient**: If PVA doesn't converge at expected depth, increase ancilla count or switch to post-selection
- **Noise sensitivity**: PVA may be more noise-sensitive due to projector structure; apply error mitigation
- **Parametrization trap**: Ensure correct parametrization mapping (ISQ-QSP vs ADAPT-VQE forms)
## Resources
- arXiv:2606.07084 - Projector Quantum Variational Ansatz
- Related: ADAPT-VQE, Quantum Signal Processing (QSP), Quantum Phase Estimation (QPE)
## Related Skills
- quantum-optimization-qaoa - Alternative variational quantum optimization
- quantum-neural-architecture - Quantum circuit architecture design
- quantum-control-engineering - Quantum control patterns
Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.
No comments yet. Be the first to comment!