메뉴
Methodology for classical verification of quantum computation by testing anti-commuting operators on quantum devices.
기본적으로 소스를 먼저 확인하는 Prompt가 선택됩니다. 직접 명령으로 전환하거나 로컬 사본을 다운로드할 수도 있습니다.
설치 여부를 결정하기 전에 SKILL.md와 SkillsMP에 표시된 보조 파일을 읽어 보세요.
SOC 직업 분류 기준
Codex 또는 Claude로 설치 이 Prompt를 복사해 Codex, Claude 또는 다른 어시스턴트에 붙여 넣으면 Skill 페이지를 검토하고 설치를 진행할 수 있습니다.
직접 명령은 검토 Prompt를 거치지 않습니다. 실행하기 전에 소스를 확인하세요.
npx skills add https://github.com/hiyenwong/ai_collection --skill quantum-qubit-verification명령은 한 줄로 유지됩니다. 복사하기 전에 가로로 스크롤해 전체 내용을 확인하세요.
로컬 사본을 원하시나요? SkillsMP에서 현재 제공할 수 있는 파일을 다운로드하세요.
SKILL.md 표시 중
| name | quantum-qubit-verification |
| description | Methodology for classical verification of quantum computation by testing anti-commuting operators on quantum devices. |
Classical verification of quantum computation methodology — testing for the presence of anti-commuting operators on quantum devices to verify quantum behavior without requiring quantum capabilities from the verifier. Based on arXiv:2606.05527.
Determine the type of quantum verification needed:
Choose appropriate protocol based on requirements:
| Protocol | Use Case | Overhead |
|---|---|---|
| CHSH-based | Bell inequality violation | Low |
| Clifford verification | Stabilizer states | Medium |
| Interactive proof | General circuits | High |
| Anti-commuting test | Device independence | Medium |
The core test verifies that a quantum device implements anti-commuting operators:
If verification fails due to noise:
1. Characterize noise model first
2. Apply error mitigation techniques
3. Increase sample size for statistical power
4. Use noise-robust verification protocols
To minimize false positive rate:
1. Set appropriate significance level (α)
2. Use multiple independent tests
3. Apply Bonferroni correction for multiple hypotheses
User: "Verify that this device implements a genuine qubit"
Agent Process:
1. Select anti-commuting Pauli pair (X, Z)
2. Prepare computational basis states |0⟩, |1⟩
3. Request device to measure in X and Z bases
4. Collect N measurement outcomes per basis
5. Compute CHSH-like correlation score
6. Verify score exceeds classical bound by > 3σ
7. Report: "Device verified as quantum with confidence p > 0.999"
This skill focuses on the cryptographic foundations of quantum verification, particularly the minimal structure required to verify quantum devices classically.
Graph-native Python reimplementation of the Information Dynamics of Music (IDyOM) model that represents predictive memories as explicit graph objects for musical expectation modeling and network analysis.
Physics-aware end-to-end deep reinforcement learning methodology for quadcopter control with actuator dynamics modeling.
Reinforced Dreamer methodology for asymmetric reinforcement learning using latent guidance to improve world model representations and behaviors in model-based RL.