Quantum Computing GuideSAFE
🔬 A curated collection of 23,000+ agent skills for empirical research across 8 social science disciplines. | 精选 23,000+ AI Agent 技能库,覆盖8大社会科学学科的实证研究。CoPaper.AI 20分钟完成一篇可复现的规范实证论文,并支持用户上传 Skills。-- Maintained by CoPaper.AI from Stanford REAP.
Overview
🔬 A curated collection of 23,000+ agent skills for empirical research across 8 social science disciplines. | 精选 23,000+ AI Agent 技能库,覆盖8大社会科学学科的实证研究。CoPaper.AI 20分钟完成一篇可复现的规范实证论文,并支持用户上传 Skills。-- Maintained by CoPaper.AI from Stanford REAP.
e1ba289846fdOBSERVED · 2026-10-08Host compatibility
What the documentation claims. We have not run a compatibility test.
| Host | Status | Notes |
|---|---|---|
| openclaw | mentioned |
What it tells the agent
The instruction file, verbatim from the audited commit — this is the text the model reads, and the surface the audit's instruction layer examines. Quoted here so you can judge it without cloning anything.
---
name: quantum-computing-guide
description: "Explore quantum computing research with Qiskit and Cirq frameworks"
metadata:
openclaw:
emoji: "⚛️"
category: "domains"
subcategory: "physics"
keywords: ["quantum computing", "Qiskit", "Cirq", "quantum circuits", "qubit", "quantum algorithms"]
source: "wentor-research-plugins"
---
# Quantum Computing Guide
A skill for conducting quantum computing research using Qiskit (IBM) and Cirq (Google) frameworks. Covers quantum circuit construction, fundamental algorithms, noise simulation, and practical considerations for running experiments on quantum hardware.
## Quantum Computing Fundamentals
### Key Concepts
```
Qubit: The basic unit of quantum information
- Superposition: A qubit can be in a state |0>, |1>, or any
linear combination alpha|0> + beta|1> where |alpha|^2 + |beta|^2 = 1
- Measurement: Collapses to |0> with probability |alpha|^2
or |1> with probability |beta|^2
Entanglement: Two qubits can be correlated in ways impossible classically
- Bell state: (|00> + |11>) / sqrt(2)
- Measuring one qubit instantly determines the other
Quantum gates: Unitary operations that transform qubit states
- Single-qubit: H (Hadamard), X (NOT), Z, S, T, Rx, Ry, Rz
- Two-qubit: CNOT, CZ, SWAP
- Multi-qubit: Toffoli (CCNOT), Fredkin (CSWAP)
```
## Building Quantum Circuits with Qiskit
### Basic Circuit Construction
```python
from qiskit import QuantumCircuit
from qiskit_aer import AerSimulator
def create_bell_state() -> QuantumCircuit:
"""
Create a Bell state (maximally entangled pair).
"""
qc = QuantumCircuit(2, 2)
# Apply Hadamard to qubit 0 (creates superposition)
qc.h(0)
# Apply CNOT with qubit 0 as control, qubit 1 as target
qc.cx(0, 1)
# Measure both qubits
qc.measure([0, 1], [0, 1])
return qc
def run_circuit(qc: QuantumCircuit, shots: int = 1024) -> dict:
"""
Run a quantum circuit on a simulator.
Args:
qc: Quantum circuit to execute
shots: Number of measurement repetitions
"""
simulator = AerSimulator()
result = simulator.run(qc, shots=shots).result()
counts = result.get_counts()
return {
"counts": counts,
"probabilities": {
state: count / shots for state, count in counts.items()
}
}
```
### Quantum Teleportation Circuit
```python
def quantum_teleportation() -> QuantumCircuit:
"""
Implement quantum teleportation protocol.
Transfers the state of qubit 0 to qubit 2 using entanglement.
"""
qc = QuantumCircuit(3, 3)
# Prepare an arbitrary state on qubit 0
qc.rx(1.2, 0)
qc.rz(0.7, 0)
qc.barrier()
# Create entangled pair (qubits 1 and 2)
qc.h(1)
qc.cx(1, 2)
qc.barrier()
# Bell measurement on qubits 0 and 1
qc.cx(0, 1)
qc.h(0)
qc.measure([0, 1], [0, 1])
qc.barrier()
# Conditional corrections on qubit 2
qc.cx(1, 2)
qc.cz(0, 2)
qc.measure(2, 2)
return qc
```
## Fundamental Quantum Algorithms
### Algorithm Overview
| Algorithm | Speedup | Problem |
|-----------|---------|---------|
| Grover's | Quadratic (sqrt(N)) | Unstructured search |
| Shor's | Exponential | Integer factorization |
| VQE | Heuristic | Ground state energy |
| QAOA | Heuristic | Combinatorial optimization |
| Quantum Phase Estimation | Exponential | Eigenvalue estimation |
| HHL | Exponential (conditions apply) | Linear systems |
### Variational Quantum Eigensolver (VQE)
```python
from qiskit.circuit.library import TwoLocal
def build_vqe_circuit(n_qubits: int, depth: int = 2) -> dict:
"""
Build a parameterized ansatz circuit for VQE.
Args:
n_qubits: Number of qubits
depth: Circuit depth (repetitions)
"""
ansatz = TwoLocal(
n_qubits,
rotation_blocks=["ry", "rz"],
entanglement_blocks="cx",
entanglement="linear",
reps=depth
)
return {
"circuit": ansatz,
"n_parameters": ansatz.num_parameters,
"description": (
"VQE uses a classical optimizer to minimize "
"<psi(theta)|H|psi(theta)> where psi(theta) is the "
"parameterized quantum state and H is the Hamiltonian."
)
}
```
## Noise and Error Mitigation
### Simulating Realistic Noise
```python
from qiskit_aer.noise import NoiseModel, depolarizing_error
def create_noisy_simulator(error_rate: float = 0.01) -> dict:
"""
Create a noise model for realistic quantum simulation.
Args:
error_rate: Depolarizing error probability per gate
"""
noise_model = NoiseModel()
# Single-qubit gate error
error_1q = depolarizing_error(error_rate, 1)
noise_model.add_all_qubit_quantum_error(error_1q, ["h", "rx", "ry", "rz"])
# Two-qubit gate error (typically higher)
error_2q = depolarizing_error(error_rate * 10, 2)
noise_model.add_all_qubit_quantum_error(error_2q, ["cx"])
return {
"noise_model": noise_model,
"single_qubit_error": error_rate,
"two_qubit_error": error_rate * 10,
"mitigation_strategies": [
"Zero-Noise Extrapolation (ZNE)",
"Probabilistic Error Cancellation (PEC)",
"Measurement error mitigation",
"Dynamical decoupling",
"Quantum error correction (surface codes)"
]
}
```
## Running on Real Hardware
### Practical Considerations
```
1. Qubit connectivity:
Real devices have limited qubit connections (not all-to-all)
SWAP gates are needed to route operations -> increases circuit depth
2. Gate fidelity:
Single-qubit gates: ~99.9% fidelity
Two-qubit gates: ~99-99.5% fidelity
Limits useful circuit depth to ~100-1000 gates
3. Coherence times:
T1 (energy relaxation): 100-500 microseconds
T2 (dephasing): 50-200 microseconds
Circuit must complete before decoherence
4. Queue times:
Real quantum computers have job queues (Trust audit
SAFEgrade B · trust 89/100 Nothing in the source contradicts what it says it does. Grade A is reserved for packages that have also passed the behavioural sandbox.
| Layer | What it checks | Result |
|---|---|---|
| L0 | Provenance & inventory | PASS |
| L1 | Static analysis of the code | NA |
| L2 | Instruction surface (what it tells the agent) | PASS |
| L3 | Class-specific surface | PASS |
| L4 | Behavioural (sandbox) | SKIPPED |
What the source does
- Filesystem
- none-observed
- Network
- none-observed
- Shell
- none-observed
- Dependencies
- pinned
- Secrets in source
- none-found
Findings (0)
No findings outside the package's declared scope.
Gates applied: no_behavioural_pass.
e1ba289846fdfull audit observations/trust-audit/skill/brycewang-stanford__quantum-computing-guide.json · Report an issue / request a re-scanAudit history
Every audit this skill has had.
| Date | Source | Verdict | Grade | Score | Change |
|---|---|---|---|---|---|
| 2026-10-08 | e1ba289846fd | SAFE | B | 89 | first audit |
Questions
What does the Quantum Computing Guide skill do?
🔬 A curated collection of 23,000+ agent skills for empirical research across 8 social science disciplines. | 精选 23,000+ AI Agent 技能库,覆盖8大社会科学学科的实证研究。CoPaper.AI 20分钟完成一篇可复现的规范实证论文,并支持用户上传 Skills。-- Maintained by CoPaper.AI from Stanford REAP.
Is Quantum Computing Guide safe to install?
The audit found nothing in the source that contradicts what it says it does, and graded it B (89/100). Grade A is held back for packages that have also passed a sandboxed behavioural run, which is why a clean skill reads B.
What can Quantum Computing Guide access on my machine?
The audit observed no filesystem, network or shell use at all in its source.
Which assistants does Quantum Computing Guide work with?
Its documentation mentions openclaw. That is what the text claims, not a compatibility test we ran.
How current is this page?
The grade is for one exact copy of the source (e1ba289846fd), read on 2026-10-08. The repository is watched, and a new audit runs when it changes — this is the first audit.