Knowledge base
Terms and Conditions
Support
My QI

Knowledge base

The basics of Quantum Computing
What is a qubit?
Superposition and entanglement
What is a quantum algorithm?
Hello quantum world
Accounts

Introduction quick guide
Working with the editor
Executing your algorithm
Displaying and downloading your results
Creating a new project
Managing your projects
Managing your account
Qubit register
Bit register

Introduction advanced guide
Software Development Kit
Low-level API
cQASM: A Quantum Programming Language
cQASM: Compilation
cQASM: Qubit gate operations
cQASM: Single Gate Multiple-Qubits
cQASM: Qubit initialization and measurement
cQASM: Display commands
LibKet
Global phase

Code examples: Overview
Code example: Deutsch-Jozsa algorithm
Code example: Quantum full adder
Code example: Grover's algorithm
Code example: Repetition code
Code example: Quantum classification
Jupyter example: Quantum distance-based classifier (part 1)
Jupyter example: Quantum distance-based classifier (part 2)
Jupyter example: Quantum distance-based classifier (part 3)
Jupyter example: Using API and SDK
Jupyter example: Measurement error mitigation
Jupyter example: Grover's search
Jupyter example: Quantum Approximate Optimization Algorithm (QAOA)

Hardware backends
Spin-2: Operational specifics
Starmon-7: Operational specifics

Emulator backends
cQASM: Binary controlled gates
cQASM: Display commands
cQASM: Error models
Optimization of simulations
Resetting qubits

Pauli-Y gate

The Pauli-Y gate is a single-qubit rotation through $\pi$ radians around the y-axis.

$\ Y= \sigma_y = \sigma_2 = \begin{pmatrix} 0 & -i \\ i & 0 \end{pmatrix}$

Examples:

QI

About Qi My Qi Release notes Contact

Support

Getting started Knowledge base FAQ Terms and privacy policy

Partners

QuTech TNO TU Delft SURFsara

Social

Twitter Facebook LinkedIn Youtube

© 2025 Quantum Inspire. All rights reservedQuTech, a collaboration founded by: