Quantum Computing

knowledge skill

Simulates or describes quantum circuits for specific computational problems. Produces a quantum circuit diagram or gate sequence in QASM format for a given algorithm.

Worked examples

• {"input": {"algorithm": "Grover", "qubits": 4, "problem_size": 16}, "output": {"circuit": "OPENQASM 2.0; include \"qelib1.inc\"; qreg q[4]; creg c[4]; x q[0]; x q[1]; h q[0]; h q[1]; h q[2]; h q[3]; oracle q; h q[0]; h q[1]; h q[2]; h q[3]; measure q -> c;", "gates": ["h", "x", "oracle", "h", "measure"], "depth": 8}}
• {"input": {"algorithm": "Shor", "qubits": 8, "problem_size": 21}, "output": {"circuit": "OPENQASM 2.0; include \"qelib1.inc\"; qreg q[8]; creg c[8]; h q[0]; h q[1]; h q[2]; h q[3]; h q[4]; h q[5]; h q[6]; h q[7]; modular_exponentiation q[0],q[1],q[2],q[3],21; quantum_fft q[0],q[1],q[2],q[3]; measure q -> c;", "gates": ["h", "modular_exponentiation", "quantum_fft", "measure"], "depth": 24}}

Input

• algorithm: string: name of the quantum algorithm (e.g., 'Grover', 'Shor')
• qubits: integer: number of qubits to use
• problem_size: integer: size of the problem instance (e.g., 2048 for Shor's factoring)

Output

• circuit: string: QASM representation of the quantum circuit
• gates: array: list of gates applied in the circuit
• depth: integer: total gate depth of the circuit

Details

• Skill type: knowledge skill
• Safety level: safe_public_research
• Version: 1.0.0