Experimental Data¶
This document contains the complete experimental datasets used in the quantum pattern analysis research. The data includes concept extractions from quantum computing frameworks, pattern matching results, and pattern definitions from the PlanQK Pattern Atlas.
Overview¶
The experimental data consists of: - Framework Concept Extractions: Complete datasets of quantum concepts extracted from Classiq, PennyLane, and Qiskit frameworks - Pattern Matching Results: Analysis of how concepts match with known quantum patterns - Pattern Atlas Data: Complete set of quantum patterns from the PlanQK Pattern Atlas
All datasets are provided in their entirety to ensure reproducibility and enable further analysis.
Classiq Quantum Concepts¶
The complete dataset of quantum concepts extracted from the Classiq framework.
File: classiq_quantum_concepts.csv
Total Concepts: 65
| Row | name | summary |
|---|---|---|
| 1 | .classiq.open_library.functions.amplitude_amplification.amplitude_amplification | Applies the Amplitude Amplification algorithm; Prepares a state using the given space_transform function, and applies reps repetititions of the grover operator, using the given oracle functions which marks the "good" states. |
| 2 | .classiq.open_library.functions.amplitude_amplification.exact_amplitude_amplification | Applies an exact version of the Amplitude Amplification algorithm, assuming knowledge of the amplitude of the marked state. The function should be applied on the zero state, and it takes care for preparing the initial state before amplification using the space_transform. |
| 3 | .classiq.open_library.functions.amplitude_estimation.amplitude_estimation | Estimate the probability of a state being marked by the operand oracle as a "good state. ". |
| 4 | .classiq.open_library.functions.discrete_sine_cosine_transform.qct_qst_type1 | Applies the quantum discrete cosine (DCT) and sine (DST) transform of type 1 to the qubit array x. Corresponds to the matrix (with $n\equiv$`x. |
| 5 | .classiq.open_library.functions.discrete_sine_cosine_transform.qct_qst_type2 | Applies the quantum discrete cosine (DCT) and sine (DST) transform of type 2 to the qubit array x concatenated with q, with q being the MSB. Corresponds to the matrix (with $n\equiv$`x. |
| 6 | .classiq.open_library.functions.discrete_sine_cosine_transform.qct_type2 | Applies the quantum discrete cosine (DCT) transform of type 2, ${ m DCT}^{(2)}$, to the qubit array x. |
| 7 | .classiq.open_library.functions.discrete_sine_cosine_transform.qst_type2 | Applies the quantum discrete sine (DST) transform of type 2, ${ m DST}^{(2)}$, to the qubit array x. |
| 8 | .classiq.open_library.functions.grover.phase_oracle | Creates a phase oracle operator based on a predicate function. |
| 9 | .classiq.open_library.functions.grover.reflect_about_zero | Reflects the state about the |
| 10 | .classiq.open_library.functions.grover.grover_diffuser | Reflects the given state about the A |
| 11 | .classiq.open_library.functions.grover.grover_operator | Applies the grover operator, defined by:. |
| 12 | .classiq.open_library.functions.grover.grover_search | Applies Grover search algorithm. |
| 13 | .classiq.open_library.functions.hea.full_hea | Implements an ansatz on a qubit array x with the given 1-qubit and 2-qubit operations. |
| 14 | .classiq.open_library.functions.lcu.lcu | Implements a general linear combination of unitaries (LCU) procedure. The algorithm prepares a superposition over the unitaries according to magnitudes, and then conditionally applies each unitary controlled by the block. |
| 15 | .classiq.open_library.functions.lcu.lcu_pauli | Applies a linear combination of unitaries (LCU) where each unitary is a Pauli term, represented as a tensor product of Pauli operators. The function prepares a superposition over the unitaries according to the given magnitudes and phases, and applies the corresponding Pauli operators conditionally. |
| 16 | .classiq.open_library.functions.linear_pauli_rotation.linear_pauli_rotations | Performs a rotation on a series of $m$ target qubits, where the rotation angle is a linear function of an $n$-qubit control register. |
| 17 | .classiq.open_library.functions.lookup_table.span_lookup_table | Applies a classical function to quantum numbers. |
| 18 | .classiq.open_library.functions.modular_exponentiation.qft_space_add_const | Adds a constant to a quantum number (in the Fourier space) using the Quantum Fourier Transform (QFT) Adder algorithm. Assuming that the input phi_b has n qubits, the result will be $\phi_b+=value \mod 2^n$. |
| 19 | .classiq.open_library.functions.modular_exponentiation.cc_modular_add | Adds a constant a to a quantum number phi_b modulo the constant n, controlled by 2 qubits. The quantum number phi_b and the constant a are assumed to be in the QFT space. |
| 20 | .classiq.open_library.functions.modular_exponentiation.c_modular_multiply | Performs out-of-place multiplication of a quantum number x by a classical number a modulo classical number n, controlled by a quantum bit ctrl and adds the result to a quantum array b. Applies $b += xa \mod n$ if ctrl=1, and the identity otherwise. |
| 21 | .classiq.open_library.functions.modular_exponentiation.multiswap | Swaps the qubit states between two arrays. Qubits of respective indices are swapped, and additional qubits in the longer array are left unchanged. |
| 22 | .classiq.open_library.functions.modular_exponentiation.inplace_c_modular_multiply | Performs multiplication of a quantum number x by a classical number a modulo classical number n, controlled by a quantum bit ctrl. Applies $x=xa \mod n$ if ctrl=1, and the identity otherwise. |
| 23 | .classiq.open_library.functions.modular_exponentiation.modular_add_qft_space | Adds a constant a to a quantum number phi_b modulo the constant n. The quantum number phi_b is assumed to be in the QFT space. |
| 24 | .classiq.open_library.functions.modular_exponentiation.modular_multiply | Performs out-of-place multiplication of a quantum number x by a classical number a modulo classical number n, and adds the result to a quantum array b (Applies $b += xa \mod n$). |
| 25 | .classiq.open_library.functions.modular_exponentiation.inplace_modular_multiply | Performs multiplication of a quantum number x by a classical number a modulo classical number n (Applies $x=xa \mod n$). |
| 26 | .classiq.open_library.functions.modular_exponentiation.modular_exp | Raises a classical integer a to the power of a quantum number power modulo classical integer n times a quantum number x. Performs $x=(a^{power} \mod n)*x$ in-place. |
| 27 | .classiq.open_library.functions.qaoa_penalty.qaoa_mixer_layer | Applies the mixer layer for the QAOA algorithm. The mixer layer is a sequence of X gates applied to each qubit in the target quantum array variable. |
| 28 | .classiq.open_library.functions.qaoa_penalty.qaoa_cost_layer | Applies the cost layer to the QAOA model. |
| 29 | .classiq.open_library.functions.qaoa_penalty.qaoa_layer | Applies the QAOA layer, which concatenates the cost layer and the mixer layer. |
| 30 | .classiq.open_library.functions.qaoa_penalty.qaoa_init | Initializes the QAOA circuit by applying the Hadamard gate to all qubits. |
| 31 | .classiq.open_library.functions.qaoa_penalty.qaoa_penalty | Applies the penalty layer to the QAOA model. |
| 32 | .classiq.open_library.functions.qft_functions.qft_no_swap | Applies the Quantum Fourier Transform (QFT) without the swap gates. |
| 33 | .classiq.open_library.functions.qft_functions.qft | Performs the Quantum Fourier Transform (QFT) on target in-place. Implements the following transformation:. |
| 34 | .classiq.open_library.functions.qpe.qpe_flexible | Implements the Quantum Phase Estimation (QPE) algorithm, which estimates the phase (eigenvalue) associated with an eigenstate of a given unitary operator $U$. This is a flexible version that allows the user to provide a callable that generates the unitary operator $U^k$ for a given integer $k$, offering greater flexibility in handling different quantum circuits using some powering rule. |
| 35 | .classiq.open_library.functions.qpe.qpe | Implements the standard Quantum Phase Estimation (QPE) algorithm, which estimates the phase (eigenvalue) associated with an eigenstate of a given unitary operator $U$. |
| 36 | .classiq.open_library.functions.qsvt.qsvt_step | Applies a single QSVT step, composed of 2 projector-controlled-phase rotations, and applications of the block encoding unitary u and its inverse:. |
| 37 | .classiq.open_library.functions.qsvt.qsvt | Implements the Quantum Singular Value Transformation (QSVT) - an algorithmic framework, used to apply polynomial transformations of degree d on the singular values of a block encoded matrix, given as the unitary u. Given a unitary $U$, a list of phase angles $\phi_1, \phi_2,. |
| 38 | .classiq.open_library.functions.qsvt.projector_controlled_phase | Assigns a phase to the entire subspace determined by the given projector. Corresponds to the operation:. |
| 39 | .classiq.open_library.functions.qsvt.qsvt_inversion | Implements matrix inversion on a given block-encoding of a square matrix, using the QSVT framework. Applies a polynomial approximation of the inverse of the singular values of the matrix encoded in u. |
| 40 | .classiq.open_library.functions.qsvt.projector_controlled_double_phase | Assigns 2 phases to the entire subspace determined by the given projector, each one is controlled differentely on a given lcu qvar. Used in the context of the qsvt_lcu function. |
| 41 | .classiq.open_library.functions.qsvt.qsvt_lcu_step | Applies a single QSVT-lcu step, composed of 2 double phase projector-controlled-phase rotations, and applications of the block encoding unitary u and its inverse:. |
| 42 | .classiq.open_library.functions.qsvt.qsvt_lcu | Implements the Quantum Singular Value Transformation (QSVT) for a linear combination of odd and even polynomials, so that it is possible to encode a polynomial of indefinite parity, such as approximation to exp(i*A) or exp(A). Should work for Hermitian block encodings. |
| 43 | .classiq.open_library.functions.qsvt.gqsp | Implements Generalized Quantum Signal Processing (GQSP), which realizes a (Laurent) polynomial transformation of degree d on the eigenvalues of the given signal unitary u. The protocol is according to https://arxiv. |
| 44 | .classiq.open_library.functions.state_preparation.prepare_uniform_trimmed_state | Initializes a quantum variable in a uniform superposition of the first m computational basis states:. |
| 45 | .classiq.open_library.functions.state_preparation.prepare_uniform_interval_state | Initializes a quantum variable in a uniform superposition of the specified interval in the computational basis states:. |
| 46 | .classiq.open_library.functions.state_preparation.prepare_ghz_state | Initializes a quantum variable in a Greenberger-Horne-Zeilinger (GHZ) state. i. |
| 47 | .classiq.open_library.functions.state_preparation.prepare_exponential_state | Prepares a quantum state with exponentially decreasing amplitudes. The state is prepared in the computational basis, with the amplitudes of the states decreasing exponentially with the index of the state:. |
| 48 | .classiq.open_library.functions.state_preparation.prepare_bell_state | Initializes a quantum array of size 2 in one of the four Bell states. |
| 49 | .classiq.open_library.functions.state_preparation.inplace_prepare_int | This function is deprecated. Use in-place-xor assignment statement in the form target-var ^= quantum-expression or inplace_xor(quantum-expression, target-var) instead. |
| 50 | .classiq.open_library.functions.state_preparation.prepare_int | This function is deprecated. Use assignment statement in the form target-var ** |
| 51 | .classiq.open_library.functions.state_preparation.inplace_prepare_complex_amplitudes | Prepares a quantum state with amplitudes and phases for each state according to the given parameters, in polar representation. Expects to act on an initialized zero state $ |
| 52 | .classiq.open_library.functions.state_preparation.prepare_complex_amplitudes | Initializes and prepares a quantum state with amplitudes and phases for each state according to the given parameters, in polar representation. |
| 53 | .classiq.open_library.functions.state_preparation.prepare_dicke_state_unary_input | Prepares a Dicke state with a variable number of excitations based on an unary-encoded input. |
| 54 | .classiq.open_library.functions.state_preparation.prepare_dicke_state | Prepares a Dicke state with k excitations over the provided quantum register. |
| 55 | .classiq.open_library.functions.state_preparation.prepare_basis_state | Initializes a quantum array in the specified basis state. |
| 56 | .classiq.open_library.functions.state_preparation.prepare_linear_amplitudes | Initializes a quantum variable in a state with linear amplitudes: $$ |
| 57 | .classiq.open_library.functions.state_preparation.inplace_prepare_sparse_amplitudes | Prepares a quantum state with the given (complex) amplitudes. The input is given sparse format, as a list of non-zero states and their corresponding amplitudes. |
| 58 | .classiq.open_library.functions.state_preparation.prepare_sparse_amplitudes | Initializes and prepares a quantum state with the given (complex) amplitudes. The input is given sparse format, as a list of non-zero states and their corresponding amplitudes. |
| 59 | .classiq.open_library.functions.swap_test.swap_test | Tests the overlap (in terms of fidelity) of two quantum states. The fidelity of state1 and state2 is calculated from the probability of measuring test qubit in the state 0 as follows:. |
| 60 | .classiq.open_library.functions.utility_functions.apply_to_all | Applies the single-qubit operand gate_operand to each qubit in the qubit array target. |
| 61 | .classiq.open_library.functions.utility_functions.hadamard_transform | Applies Hadamard transform to the target qubits. |
| 62 | .classiq.open_library.functions.utility_functions.modular_increment | Adds $a$ to $x$ modulo the range of $x$, assumed that $x$ is a non-negative integer and $a$ is an integer. Mathematically it is described as:. |
| 63 | .classiq.open_library.functions.variational.encode_in_angle | Creates an angle encoding of n data points on n qubits. |
| 64 | .classiq.open_library.functions.variational.encode_on_bloch | Creates a dense angle encoding of n data points on n//2 qubits. |
| 65 | .classiq.qmod.builtins.functions.exponentiation.suzuki_trotter | Applies the Suzuki-Trotter decomposition to a Pauli operator. |
PennyLane Quantum Concepts¶
The complete dataset of quantum concepts extracted from the PennyLane framework.
File: pennylane_quantum_concepts.csv
Total Concepts: 68
| Row | name | summary |
|---|---|---|
| 1 | .pennylane.pennylane.templates.embeddings.amplitude.AmplitudeEmbedding | Encodes :math:2^n features into the amplitude vector of :math:n qubits. |
| 2 | .pennylane.pennylane.templates.embeddings.angle.AngleEmbedding | Encodes :math:N features into the rotation angles of :math:n qubits, where :math:N \leq n. |
| 3 | .pennylane.pennylane.templates.embeddings.basis.BasisEmbedding | Encodes :math:n binary features into a basis state of :math:n qubits. |
| 4 | .pennylane.pennylane.templates.embeddings.displacement.DisplacementEmbedding | Encodes :math:N features into the displacement amplitudes :math:r or phases :math:\phi of :math:M modes, where :math:N\leq M. |
| 5 | .pennylane.pennylane.templates.embeddings.iqp.IQPEmbedding | Encodes :math:n features into :math:n qubits using diagonal gates of an IQP circuit. |
| 6 | .pennylane.pennylane.templates.embeddings.qaoaembedding.QAOAEmbedding | Encodes :math:N features into :math:n>N qubits, using a layered, trainable quantum circuit that is inspired by the QAOA ansatz proposed by Killoran et al. (2020) <https://arxiv.org/abs/2001.03622>_. |
| 7 | .pennylane.pennylane.templates.embeddings.squeezing.SqueezingEmbedding | Encodes :math:N features into the squeezing amplitudes :math:r \geq 0 or phases :math:\phi \in [0, 2\pi) of :math:M modes, where :math:N\leq M. |
| 8 | .pennylane.pennylane.templates.layers.basic_entangler.BasicEntanglerLayers | Layers consisting of one-parameter single-qubit rotations on each qubit, followed by a closed chain or ring of CNOT gates. |
| 9 | .pennylane.pennylane.templates.layers.cv_neural_net.CVNeuralNetLayers | A sequence of layers of a continuous-variable quantum neural network, as specified in Killoran et al. (2019) <https://doi.org/10.1103/PhysRevResearch.1.033063>_. |
| 10 | .pennylane.pennylane.templates.layers.gate_fabric.GateFabric | Implements a local, expressive, and quantum-number-preserving ansatz proposed by Anselmetti et al. (2021) <https://doi.org/10.1088/1367-2630/ac2cb3>_. |
| 11 | .pennylane.pennylane.templates.layers.particle_conserving_u1.ParticleConservingU1 | Implements the heuristic VQE ansatz for quantum chemistry simulations using the particle-conserving gate :math:U_{1,\mathrm{ex}} proposed by Barkoutsos et al. in arXiv:1805.04340 <https://arxiv.org/abs/1805.04340>_. |
| 12 | .pennylane.pennylane.templates.layers.particle_conserving_u2.ParticleConservingU2 | Implements the heuristic VQE ansatz for Quantum Chemistry simulations using the particle-conserving entangler :math:U_\mathrm{ent}(\vec{\theta}, \vec{\phi}) proposed in arXiv:1805.04340 <https://arxiv.org/abs/1805.04340>__. |
| 13 | .pennylane.pennylane.templates.layers.random.RandomLayers | Layers of randomly chosen single qubit rotations and 2-qubit entangling gates, acting on randomly chosen qubits. |
| 14 | .pennylane.pennylane.templates.layers.simplified_two_design.SimplifiedTwoDesign | Layers consisting of a simplified 2-design architecture of Pauli-Y rotations and controlled-Z entanglers proposed in Cerezo et al. (2021) <https://doi.org/10.1038/s41467-021-21728-w>_. |
| 15 | .pennylane.pennylane.templates.layers.strongly_entangling.StronglyEntanglingLayers | Layers consisting of single qubit rotations and entanglers, inspired by the circuit-centric classifier design arXiv:1804.00633 <https://arxiv.org/abs/1804.00633>_. |
| 16 | .pennylane.pennylane.templates.state_preparations.arbitrary_state_preparation.ArbitraryStatePreparation | Implements an arbitrary state preparation on the specified wires. |
| 17 | .pennylane.pennylane.templates.state_preparations.basis_qutrit.QutritBasisStatePreparation | Prepares a basis state on the given wires using a sequence of TShift gates. |
| 18 | .pennylane.pennylane.templates.state_preparations.cosine_window.CosineWindow | CosineWindow(wires) Prepares an initial state with a cosine wave function. |
| 19 | .pennylane.pennylane.templates.state_preparations.mottonen.MottonenStatePreparation | Prepares an arbitrary state on the given wires using a decomposition into gates developed by Möttönen et al. (2004) <https://arxiv.org/abs/quant-ph/0407010>_. |
| 20 | .pennylane.pennylane.templates.state_preparations.qrom_state_prep.QROMStatePreparation | Prepares a quantum state using Quantum Read-Only Memory (QROM). |
| 21 | .pennylane.pennylane.templates.state_preparations.state_prep_mps.MPSPrep | Prepares an initial state from a matrix product state (MPS) representation. |
| 22 | .pennylane.pennylane.templates.state_preparations.superposition.Superposition | Prepare a superposition of computational basis states. |
| 23 | .pennylane.pennylane.templates.subroutines.amplitude_amplification.AmplitudeAmplification | Applies amplitude amplification. |
| 24 | .pennylane.pennylane.templates.subroutines.aqft.AQFT | AQFT(order, wires) Apply an approximate quantum Fourier transform (AQFT). |
| 25 | .pennylane.pennylane.templates.subroutines.arbitrary_unitary.ArbitraryUnitary | Implements an arbitrary unitary on the specified wires. |
| 26 | .pennylane.pennylane.templates.subroutines.arithmetic.adder.Adder | Performs the in-place modular addition operation. |
| 27 | .pennylane.pennylane.templates.subroutines.arithmetic.mod_exp.ModExp | Performs the out-place modular exponentiation operation. |
| 28 | .pennylane.pennylane.templates.subroutines.arithmetic.multiplier.Multiplier | Performs the in-place modular multiplication operation. |
| 29 | .pennylane.pennylane.templates.subroutines.arithmetic.out_adder.OutAdder | Performs the out-place modular addition operation. |
| 30 | .pennylane.pennylane.templates.subroutines.arithmetic.out_multiplier.OutMultiplier | Performs the out-place modular multiplication operation. |
| 31 | .pennylane.pennylane.templates.subroutines.arithmetic.out_poly.OutPoly | Performs the out-of-place polynomial operation. |
| 32 | .pennylane.pennylane.templates.subroutines.arithmetic.phase_adder.PhaseAdder | Performs the in-place modular phase addition operation. |
| 33 | .pennylane.pennylane.templates.subroutines.arithmetic.semi_adder.SemiAdder | This operator performs the plain addition of two integers :math:x and :math:y in the computational basis: |
| 34 | .pennylane.pennylane.templates.subroutines.arithmetic.temporary_and.TemporaryAND | TemporaryAND(wires, control_values) |
| 35 | .pennylane.pennylane.templates.subroutines.controlled_sequence.ControlledSequence | Creates a sequence of controlled gates raised to decreasing powers of 2. Can be used as a sub-block in building a quantum phase estimation <https://en.wikipedia.org/wiki/Quantum_phase_estimation_algorithm>__ circuit. |
| 36 | .pennylane.pennylane.templates.subroutines.fable.FABLE | Construct a unitary with the fast approximate block encoding method. |
| 37 | .pennylane.pennylane.templates.subroutines.flip_sign.FlipSign | Flips the sign of a given basis state. |
| 38 | .pennylane.pennylane.templates.subroutines.gqsp.GQSP | Implements the generalized quantum signal processing (GQSP) circuit. |
| 39 | .pennylane.pennylane.templates.subroutines.grover.GroverOperator | Performs the Grover Diffusion Operator. |
| 40 | .pennylane.pennylane.templates.subroutines.hilbert_schmidt.HilbertSchmidt | Create a Hilbert-Schmidt template that can be used to compute the Hilbert-Schmidt Test (HST). |
| 41 | .pennylane.pennylane.templates.subroutines.hilbert_schmidt.LocalHilbertSchmidt | Create a Local Hilbert-Schmidt template that can be used to compute the Local Hilbert-Schmidt Test (LHST). |
| 42 | .pennylane.pennylane.templates.subroutines.interferometer.Interferometer | General linear interferometer, an array of beamsplitters and phase shifters. |
| 43 | .pennylane.pennylane.templates.subroutines.permute.Permute | Applies a permutation to a set of wires. |
| 44 | .pennylane.pennylane.templates.subroutines.prepselprep.PrepSelPrep | Implements a block-encoding of a linear combination of unitaries. |
| 45 | .pennylane.pennylane.templates.subroutines.qchem.all_singles_doubles.AllSinglesDoubles | Builds a quantum circuit to prepare correlated states of molecules by applying all :class:~.pennylane.SingleExcitation and :class:~.pennylane.DoubleExcitation operations to the initial Hartree-Fock state. |
| 46 | .pennylane.pennylane.templates.subroutines.qchem.basis_rotation.BasisRotation | Implements a circuit that performs an exact single-body basis rotation using Givens rotations and phase shifts. |
| 47 | .pennylane.pennylane.templates.subroutines.qchem.fermionic_double_excitation.FermionicDoubleExcitation | Circuit to exponentiate the tensor product of Pauli matrices representing the double-excitation operator entering the Unitary Coupled-Cluster Singles and Doubles (UCCSD) ansatz. UCCSD is a VQE ansatz commonly used to run quantum chemistry simulations. |
| 48 | .pennylane.pennylane.templates.subroutines.qchem.fermionic_single_excitation.FermionicSingleExcitation | Circuit to exponentiate the tensor product of Pauli matrices representing the single-excitation operator entering the Unitary Coupled-Cluster Singles and Doubles (UCCSD) ansatz. UCCSD is a VQE ansatz commonly used to run quantum chemistry simulations. |
| 49 | .pennylane.pennylane.templates.subroutines.qchem.kupccgsd.kUpCCGSD | Implements the k-Unitary Pair Coupled-Cluster Generalized Singles and Doubles (k-UpCCGSD) ansatz. |
| 50 | .pennylane.pennylane.templates.subroutines.qchem.uccsd.UCCSD | Implements the Unitary Coupled-Cluster Singles and Doubles (UCCSD) ansatz. |
| 51 | .pennylane.pennylane.templates.subroutines.qft.QFT | QFT(wires) Apply a quantum Fourier transform (QFT). |
| 52 | .pennylane.pennylane.templates.subroutines.qmc.QuantumMonteCarlo | Performs the quantum Monte Carlo estimation <https://arxiv.org/abs/1805.00109>__ algorithm. |
| 53 | .pennylane.pennylane.templates.subroutines.qpe.QuantumPhaseEstimation | Performs the quantum phase estimation <https://en.wikipedia.org/wiki/Quantum_phase_estimation_algorithm>__ circuit. |
| 54 | .pennylane.pennylane.templates.subroutines.qrom.QROM | Applies the QROM operator. |
| 55 | .pennylane.pennylane.templates.subroutines.qsvt.QSVT | QSVT(UA,projectors) Implements the quantum singular value transformation <https://arxiv.org/abs/1806.01838>__ (QSVT) circuit. |
| 56 | .pennylane.pennylane.templates.subroutines.qubitization.Qubitization | Applies the Qubitization <https://arxiv.org/abs/2204.11890>__ operator. |
| 57 | .pennylane.pennylane.templates.subroutines.reflection.Reflection | Apply a reflection about a state :math:|\Psi\rangle. |
| 58 | .pennylane.pennylane.templates.subroutines.select.Select | The Select operator, also known as multiplexer or multiplexed operation, applies different operations depending on the state of designated control wires. |
| 59 | .pennylane.pennylane.templates.subroutines.select_pauli_rot.SelectPauliRot | Applies individual single-qubit Pauli rotations depending on the state of designated control qubits. |
| 60 | .pennylane.pennylane.templates.subroutines.time_evolution.approx_time_evolution.ApproxTimeEvolution | Applies the Trotterized time-evolution operator for an arbitrary Hamiltonian, expressed in terms of Pauli gates. |
| 61 | .pennylane.pennylane.templates.subroutines.time_evolution.commuting_evolution.CommutingEvolution | Applies the time-evolution operator for a Hamiltonian expressed as a linear combination of mutually commuting Pauli words. |
| 62 | .pennylane.pennylane.templates.subroutines.time_evolution.qdrift.QDrift | An operation representing the QDrift approximation for the complex matrix exponential of a given Hamiltonian. |
| 63 | .pennylane.pennylane.templates.subroutines.time_evolution.trotter.TrotterProduct | An operation representing the Suzuki-Trotter product approximation for the complex matrix exponential of a given Hamiltonian. |
| 64 | .pennylane.pennylane.templates.subroutines.time_evolution.trotter.TrotterizedQfunc | An operation representing the Suzuki-Trotter product approximation applied to a set of operations defined in a function. |
| 65 | .pennylane.pennylane.templates.swapnetworks.ccl2.TwoLocalSwapNetwork | Apply two-local gate operations using a canonical 2-complete linear (2-CCL) swap network. |
| 66 | .pennylane.pennylane.templates.tensornetworks.mera.MERA | The MERA template broadcasts an input circuit across many wires following the architecture of a multi-scale entanglement renormalization ansatz tensor network. This architecture can be found in arXiv:quant-ph/0610099 <https://arxiv.org/abs/quant-ph/0610099> and closely resembles quantum convolutional neural networks <https://arxiv.org/abs/1810.03787>. |
| 67 | .pennylane.pennylane.templates.tensornetworks.mps.MPS | The MPS template broadcasts an input circuit across many wires following the architecture of a Matrix Product State tensor network. The result is similar to the architecture in arXiv:1803.11537 <https://arxiv.org/abs/1803.11537>_. |
| 68 | .pennylane.pennylane.templates.tensornetworks.ttn.TTN | The TTN template broadcasts an input circuit across many wires following the architecture of a tree tensor network. The result is similar to the architecture in arXiv:1803.11537 <https://arxiv.org/abs/1803.11537>_. |
Qiskit Quantum Concepts¶
The complete dataset of quantum concepts extracted from the Qiskit framework.
File: qiskit_quantum_concepts.csv
Total Concepts: 86
| Row | name | summary |
|---|---|---|
| 1 | .qiskit.qiskit.circuit.library.arithmetic.adders.adder.Adder | Compute the sum of two equally sized qubit registers. |
| 2 | .qiskit.qiskit.circuit.library.arithmetic.adders.adder.HalfAdderGate | Compute the sum of two equally-sized qubit registers, including a carry-out bit. |
| 3 | .qiskit.qiskit.circuit.library.arithmetic.adders.adder.ModularAdderGate | Compute the sum modulo :math:2^n of two :math:n-sized qubit registers. |
| 4 | .qiskit.qiskit.circuit.library.arithmetic.adders.adder.FullAdderGate | Compute the sum of two :math:n-sized qubit registers, including carry-in and -out bits. |
| 5 | .qiskit.qiskit.circuit.library.arithmetic.adders.cdkm_ripple_carry_adder.CDKMRippleCarryAdder | A ripple-carry circuit to perform in-place addition on two qubit registers. |
| 6 | .qiskit.qiskit.circuit.library.arithmetic.adders.draper_qft_adder.DraperQFTAdder | A circuit that uses QFT to perform in-place addition on two qubit registers. |
| 7 | .qiskit.qiskit.circuit.library.arithmetic.adders.vbe_ripple_carry_adder.VBERippleCarryAdder | The VBE ripple carry adder [1]. |
| 8 | .qiskit.qiskit.circuit.library.arithmetic.exact_reciprocal.ExactReciprocal | Exact reciprocal |
| 9 | .qiskit.qiskit.circuit.library.arithmetic.exact_reciprocal.ExactReciprocalGate | Implements an exact reciprocal function. |
| 10 | .qiskit.qiskit.circuit.library.arithmetic.functional_pauli_rotations.FunctionalPauliRotations | Base class for functional Pauli rotations. |
| 11 | .qiskit.qiskit.circuit.library.arithmetic.integer_comparator.IntegerComparator | Integer Comparator. |
| 12 | .qiskit.qiskit.circuit.library.arithmetic.integer_comparator.IntegerComparatorGate | Perform a :math:\geq (or :math:<) on a qubit register against a classical integer. |
| 13 | .qiskit.qiskit.circuit.library.arithmetic.linear_amplitude_function.LinearAmplitudeFunctionGate | A circuit implementing a (piecewise) linear function on qubit amplitudes. |
| 14 | .qiskit.qiskit.circuit.library.arithmetic.linear_pauli_rotations.LinearPauliRotationsGate | Linearly-controlled X, Y or Z rotation. |
| 15 | .qiskit.qiskit.circuit.library.arithmetic.multipliers.hrs_cumulative_multiplier.HRSCumulativeMultiplier | A multiplication circuit to store product of two input registers out-of-place. |
| 16 | .qiskit.qiskit.circuit.library.arithmetic.multipliers.multiplier.MultiplierGate | Compute the product of two equally sized qubit registers into a new register. |
| 17 | .qiskit.qiskit.circuit.library.arithmetic.multipliers.rg_qft_multiplier.RGQFTMultiplier | A QFT multiplication circuit to store product of two input registers out-of-place. |
| 18 | .qiskit.qiskit.circuit.library.arithmetic.piecewise_chebyshev.PiecewiseChebyshevGate | Piecewise Chebyshev approximation to an input function. |
| 19 | .qiskit.qiskit.circuit.library.arithmetic.piecewise_linear_pauli_rotations.PiecewiseLinearPauliRotationsGate | Piecewise-linearly-controlled Pauli rotations. |
| 20 | .qiskit.qiskit.circuit.library.arithmetic.piecewise_polynomial_pauli_rotations.PiecewisePolynomialPauliRotationsGate | Piecewise-polynomially-controlled Pauli rotations. |
| 21 | .qiskit.qiskit.circuit.library.arithmetic.polynomial_pauli_rotations.PolynomialPauliRotations | A circuit implementing polynomial Pauli rotations. |
| 22 | .qiskit.qiskit.circuit.library.arithmetic.polynomial_pauli_rotations.PolynomialPauliRotationsGate | A gate implementing polynomial Pauli rotations. |
| 23 | .qiskit.qiskit.circuit.library.arithmetic.quadratic_form.QuadraticFormGate | Implements a quadratic form on binary variables encoded in qubit registers. |
| 24 | .qiskit.qiskit.circuit.library.arithmetic.weighted_adder.WeightedAdder | A circuit to compute the weighted sum of qubit registers. |
| 25 | .qiskit.qiskit.circuit.library.arithmetic.weighted_adder.WeightedSumGate | A gate to compute the weighted sum of qubit registers. |
| 26 | .qiskit.qiskit.circuit.library.basis_change.qft.QFT | Quantum Fourier Transform Circuit. |
| 27 | .qiskit.qiskit.circuit.library.basis_change.qft.QFTGate | Quantum Fourier Transform Gate. |
| 28 | .qiskit.qiskit.circuit.library.bit_flip_oracle.BitFlipOracleGate | Implements a bit-flip oracle |
| 29 | .qiskit.qiskit.circuit.library.blueprintcircuit.BlueprintCircuit | Blueprint circuit object. |
| 30 | .qiskit.qiskit.circuit.library.boolean_logic.inner_product.InnerProductGate | A 2n-qubit Boolean function that computes the inner product of two n-qubit vectors over :math:F_2. |
| 31 | .qiskit.qiskit.circuit.library.boolean_logic.quantum_and.AND | A circuit implementing the logical AND operation on a number of qubits. |
| 32 | .qiskit.qiskit.circuit.library.boolean_logic.quantum_and.AndGate | A gate representing the logical AND operation on a number of qubits. |
| 33 | .qiskit.qiskit.circuit.library.boolean_logic.quantum_or.OR | A circuit implementing the logical OR operation on a number of qubits. |
| 34 | .qiskit.qiskit.circuit.library.boolean_logic.quantum_xor.BitwiseXorGate | An n-qubit gate for bitwise xor-ing the input with some integer amount. |
| 35 | .qiskit.qiskit.circuit.library.boolean_logic.quantum_xor.random_bitwise_xor | Create a random BitwiseXorGate. |
| 36 | .qiskit.qiskit.circuit.library.data_preparation.pauli_feature_map.z_feature_map | The first order Pauli Z-evolution circuit. |
| 37 | .qiskit.qiskit.circuit.library.data_preparation.pauli_feature_map.zz_feature_map | Second-order Pauli-Z evolution circuit. |
| 38 | .qiskit.qiskit.circuit.library.data_preparation.initializer.Initialize | Complex amplitude initialization. |
| 39 | .qiskit.qiskit.circuit.library.data_preparation.pauli_feature_map.PauliFeatureMap | The Pauli Expansion circuit. |
| 40 | .qiskit.qiskit.circuit.library.data_preparation.pauli_feature_map.self_product | Define a function map from R^n to R. |
| 41 | .qiskit.qiskit.circuit.library.data_preparation.state_preparation.StatePreparation | Complex amplitude state preparation. |
| 42 | .qiskit.qiskit.circuit.library.data_preparation.state_preparation.UniformSuperpositionGate | Implements a uniform superposition state. |
| 43 | .qiskit.qiskit.circuit.library.fourier_checking.FourierChecking | Fourier checking circuit. |
| 44 | .qiskit.qiskit.circuit.library.generalized_gates.diagonal.Diagonal | Circuit implementing a diagonal transformation. |
| 45 | .qiskit.qiskit.circuit.library.generalized_gates.diagonal.DiagonalGate | A generic diagonal quantum gate. |
| 46 | .qiskit.qiskit.circuit.library.generalized_gates.gms.GMS | Global Mølmer–Sørensen gate. |
| 47 | .qiskit.qiskit.circuit.library.generalized_gates.gms.MSGate | The Mølmer–Sørensen gate. |
| 48 | .qiskit.qiskit.circuit.library.generalized_gates.gr.GR | Global R gate. |
| 49 | .qiskit.qiskit.circuit.library.generalized_gates.gr.GRX | Global RX gate. |
| 50 | .qiskit.qiskit.circuit.library.generalized_gates.gr.GRY | Global RY gate. |
| 51 | .qiskit.qiskit.circuit.library.generalized_gates.gr.GRZ | Global RZ gate. |
| 52 | .qiskit.qiskit.circuit.library.generalized_gates.isometry.Isometry | Decomposition of arbitrary isometries from :math:m to :math:n qubits. |
| 53 | .qiskit.qiskit.circuit.library.generalized_gates.linear_function.LinearFunction | A linear reversible circuit on n qubits. |
| 54 | .qiskit.qiskit.circuit.library.generalized_gates.mcg_up_to_diagonal.MCGupDiag | Decomposes a multi-controlled gate :math:U up to a diagonal :math:D acting on the control and target qubit (but not on the ancilla qubits), i.e., it implements a circuit corresponding to a unitary :math:U', such that :math:U = D U'. |
| 55 | .qiskit.qiskit.circuit.library.generalized_gates.mcmt.MCMTGate | The multi-controlled multi-target gate, for an arbitrary singly controlled target gate. |
| 56 | .qiskit.qiskit.circuit.library.generalized_gates.mcmt.MCMTVChain | The MCMT implementation using the CCX V-chain. |
| 57 | .qiskit.qiskit.circuit.library.generalized_gates.pauli.PauliGate | A multi-qubit Pauli gate. |
| 58 | .qiskit.qiskit.circuit.library.generalized_gates.permutation.Permutation | An n_qubit circuit that permutes qubits. |
| 59 | .qiskit.qiskit.circuit.library.generalized_gates.permutation.PermutationGate | A gate that permutes qubits. |
| 60 | .qiskit.qiskit.circuit.library.generalized_gates.rv.RVGate | Rotation around arbitrary rotation axis :math:\vec{v} where :math:\|\vec{v}\|_2 is angle of rotation in radians. |
| 61 | .qiskit.qiskit.circuit.library.generalized_gates.uc.UCGate | Uniformly controlled gate (also called multiplexed gate). |
| 62 | .qiskit.qiskit.circuit.library.generalized_gates.uc_pauli_rot.UCPauliRotGate | Uniformly controlled Pauli rotations. |
| 63 | .qiskit.qiskit.circuit.library.generalized_gates.ucrz.UCRZGate | Uniformly controlled Pauli-Z rotations. |
| 64 | .qiskit.qiskit.circuit.library.generalized_gates.unitary.UnitaryGate | Class quantum gates specified by a unitary matrix. |
| 65 | .qiskit.qiskit.circuit.library.graph_state.GraphState | Circuit to prepare a graph state. |
| 66 | .qiskit.qiskit.circuit.library.graph_state.GraphStateGate | A gate representing a graph state. |
| 67 | .qiskit.qiskit.circuit.library.grover_operator.GroverOperator | The Grover operator. |
| 68 | .qiskit.qiskit.circuit.library.hamiltonian_gate.HamiltonianGate | Class for representing evolution by a Hamiltonian operator as a gate. |
| 69 | .qiskit.qiskit.circuit.library.hidden_linear_function.HiddenLinearFunction | Circuit to solve the hidden linear function problem. |
| 70 | .qiskit.qiskit.circuit.library.iqp.IQP | Instantaneous quantum polynomial (IQP) circuit. |
| 71 | .qiskit.qiskit.circuit.library.iqp.random_iqp | A random instantaneous quantum polynomial time (IQP) circuit. |
| 72 | .qiskit.qiskit.circuit.library.n_local.efficient_su2.EfficientSU2 | The hardware efficient SU(2) 2-local circuit. |
| 73 | .qiskit.qiskit.circuit.library.n_local.evolved_operator_ansatz.hamiltonian_variational_ansatz | Construct a Hamiltonian variational ansatz. |
| 74 | .qiskit.qiskit.circuit.library.n_local.evolved_operator_ansatz.EvolvedOperatorAnsatz | The evolved operator ansatz. |
| 75 | .qiskit.qiskit.circuit.library.n_local.excitation_preserving.ExcitationPreserving | The heuristic excitation-preserving wave function ansatz. |
| 76 | .qiskit.qiskit.circuit.library.n_local.n_local.NLocal | The n-local circuit class. |
| 77 | .qiskit.qiskit.circuit.library.n_local.pauli_two_design.PauliTwoDesign | The Pauli Two-Design ansatz. |
| 78 | .qiskit.qiskit.circuit.library.n_local.qaoa_ansatz.QAOAAnsatz | A generalized QAOA quantum circuit with a support of custom initial states and mixers. |
| 79 | .qiskit.qiskit.circuit.library.n_local.real_amplitudes.RealAmplitudes | The real-amplitudes 2-local circuit. |
| 80 | .qiskit.qiskit.circuit.library.n_local.two_local.TwoLocal | The two-local circuit. |
| 81 | .qiskit.qiskit.circuit.library.overlap.UnitaryOverlap | Circuit that returns the overlap between two unitaries :math:U_2^{\dag} U_1. |
| 82 | .qiskit.qiskit.circuit.library.pauli_evolution.PauliEvolutionGate | Time-evolution of an operator consisting of Paulis. |
| 83 | .qiskit.qiskit.circuit.library.phase_estimation.PhaseEstimation | Phase Estimation circuit. |
| 84 | .qiskit.qiskit.circuit.library.phase_oracle.PhaseOracle | Phase Oracle. |
| 85 | .qiskit.qiskit.circuit.library.phase_oracle.PhaseOracleGate | Implements a phase oracle. |
| 86 | .qiskit.qiskit.circuit.library.quantum_volume.QuantumVolume | A quantum volume model circuit. |
Pattern Analysis Results¶
The following tables contain the complete results of the pattern matching analysis.
Top Matched Quantum Concepts¶
The most frequently matched quantum concepts across all frameworks and projects.
Total Concepts: 20
| Rank | Framework | Concept | Matches |
|---|---|---|---|
| 1 | Classiq | ...hadamard_transform | 52 |
| 2 | Classiq | ...qpe | 30 |
| 3 | Classiq | ...qpe_flexible | 26 |
| 4 | Classiq | ...qft | 26 |
| 5 | Qiskit | ...QFT | 24 |
| 6 | Pennylane | ...QFT | 21 |
| 7 | Classiq | ...qsvt | 19 |
| 8 | Classiq | ...apply_to_all | 16 |
| 9 | Classiq | ...suzuki_trotter | 15 |
| 10 | Qiskit | ...AND | 11 |
| 11 | Classiq | ...phase_oracle | 9 |
| 12 | Pennylane | ...QuantumMonteCarlo | 9 |
| 13 | Classiq | ...grover_operator | 8 |
| 14 | Qiskit | ...z_feature_map | 8 |
| 15 | Classiq | ...qft_no_swap | 8 |
| 16 | Qiskit | ...zz_feature_map | 8 |
| 17 | Classiq | ...amplitude_amplification | 7 |
| 18 | Classiq | ...qct_qst_type2 | 7 |
| 19 | Classiq | ...qsvt_inversion | 7 |
| 20 | Qiskit | ...Permutation | 7 |
Match Type Analysis¶
Distribution of matches by type (name-based, semantic, etc.).
Total Match Types: 2
| Row | match_type | count |
|---|---|---|
| 1 | name | 373 |
| 2 | summary | 185 |
Framework Analysis¶
Distribution of matches by source framework.
Frameworks: 3
| Row | framework | count |
|---|---|---|
| 1 | classiq | 343 |
| 2 | qiskit | 112 |
| 3 | pennylane | 103 |
Pattern Frequency Analysis¶
Frequency of quantum patterns in the analysis.
Total Patterns: 25
| Row | pattern | count |
|---|---|---|
| 1 | Basis Change | 154 |
| 2 | Quantum Phase Estimation (QPE) | 57 |
| 3 | Quantum Arithmetic | 40 |
| 4 | Data Encoding | 35 |
| 5 | Quantum Singular Value Transformation | 34 |
| 6 | Circuit Construction Utility | 33 |
| 7 | Oracle | 29 |
| 8 | Amplitude Amplification | 25 |
| 9 | Hamiltonian Simulation | 20 |
| 10 | Initialization | 17 |
| 11 | Quantum Logical Operators | 13 |
| 12 | Variational Quantum Algorithm (VQA) | 13 |
| 13 | Quantum Neural Network (QNN) | 11 |
| 14 | Grover | 10 |
| 15 | Quantum Approximate Optimization Algorithm (QAOA) | 10 |
| 16 | Quantum Amplitude Estimation (QAE) | 9 |
| 17 | Linear Combination of Unitaries | 7 |
| 18 | SWAP Test | 6 |
| 19 | Variational Quantum Eigensolver (VQE) | 5 |
| 20 | Controlled Linear Rotation | 5 |
| 21 | Creating Entanglement | 5 |
| 22 | Quantum Singular Value Transformation (QSVT) | 5 |
| 23 | Phase Shift | 4 |
| 24 | Linear Combination of Unitaries (LCU) | 1 |
| 25 | Quantum Amplitude Estimation | 1 |
Quantum Patterns from PlanQK Pattern Atlas¶
This section contains the complete dataset of quantum patterns downloaded from the PlanQK Pattern Atlas. These patterns serve as the reference set for pattern matching analysis.
Total Patterns: 59
Source: PlanQK Pattern Atlas
File: quantum_patterns.json
Pattern Details¶
The following table contains all patterns with their metadata:
| Row | ID | Name | Alias | Intent |
|---|---|---|---|---|
| 1 | 1 | Pre-Trained Feature Extractor | Quantum Transfer Learning | How to process large data items through quantum neural networks (QNNs) when the number of available ... |
| 2 | 2 | Variational Parameter Transfer | — | How to obtain a problem-aware parameter initialization for [Variational Quantum Algorithms](pattern-... |
| 3 | 3 | Chained Optimization | — | How to avoid local optima and improve convergence when optimizing variational parameter values for [... |
| 4 | 4 | Quantum Clustering | How to partition a data set into different clusters based on their similarity utilizing a quantum de... | |
| 5 | 5 | Biased Initial State | — | How to utilize efficient approximations in quantum algorithms to improve the solution quality or spe... |
| 6 | 6 | Circuit Cutting | Enter your input for this section here. | How to partition the computation of a quantum circuit into multiple smaller computations fitting the... |
| 7 | 7 | Uniform Superposition | Create a uniform superposition of all possible states of a quantum register | |
| 8 | 8 | Matrix Encoding | Dynamic Encoding [Schuld and Petruccione 2018] | Represent a matrix as an operation on a quantum computer |
| 9 | 9 | Schmidt Decomposition | Prepare an arbitrary state | |
| 10 | 10 | Uncompute | This pattern has also been referred to as Unentangling or Copy-Uncompute. | Remove entanglement that resulted from a previous computation |
| 11 | 11 | Basis Encoding | Enter your input for this section here. | Represent data elements in a quantum computer in order to perform calculations |
| 12 | 12 | Angle Encoding | This pattern has also been referred to as Qubit Encoding (LaRose and Coyle 2020) since each qubit represents a single data point. | "Represent each data point by a separate qubit" [(Weigold et al. 2021)](https://ieeexplore.ieee.org/... |
| The resulting encoding of this pattern is not entangled, thus, another alias for this pattern is (Tensor) Product Encoding (Leymann and Barzen 2020). | ||||
| 13 | 13 | Creating Entanglement | Enforce a strong correlation between qubits by entangling them. | |
| 14 | 14 | Error Correction | Enter your input for this section here. | How to detect and correct errors occurring during the execution of a quantum circuit? |
| 15 | 15 | Gate Error Mitigation | Enter your input for this section here. | How to reduce the negative impact of noisy gate executions such that the pre-measurement state is cl... |
| 16 | 16 | Quantum Kernel Estimator (QKE) | Use a quantum routine to estimate a kernel for a classical SVM. | |
| 17 | 17 | Function Table | Enter your input for this section here. | Compute a function table of a finite Boolean function |
| 18 | 18 | Amplitude Amplification | Increase the probability of finding a solution | |
| 19 | 19 | Post-Selective Measurement | Select one branch of a superposition to proceed with | |
| 20 | 20 | Initialization | This pattern has also been referred to as State Preparation. | Initialize the input of a quantum register, taking into account the prerequisites of the subsequent ... |
| 21 | 21 | Unified Observability | – | How to ensure reproducibility, understandability, and quality when executing hybrid quantum applicat... |
| 22 | 22 | Alternating Operator Ansatz (AOA) | "Approximate the solution of an optimization problem" [(Weigold et al. 2021)](https://www.springer.c... | |
| 23 | 23 | Amplitude Encoding | This encoding has also been referred to as Wavefunction Encoding by (LaRose and Coyle 2020). Every quantum system is described by its wavefunction $\psi$ which also defines the measurement probabilities. By expressing that the wavefunction is used to encode data, it is therefore implied that amplitudes of the quantum system are used to represent data values. | Encode data in a compact manner that do not require calculations |
| 24 | 24 | Phase Shift | Distinguish the important aspects of a state in an efficient manner | |
| 25 | 25 | Unified Execution | – | How to execute a quantum circuit independently of the heterogeneous quantum cloud offerings and thei... |
| 26 | 26 | Quantum Application Archive | – | How to store, version, and distribute the various heterogeneous artifacts of a hybrid quantum applic... |
| 27 | 27 | Quantum Application Testing | – | How to ensure the correctness of all functionalities of a hybrid quantum application? |
| 28 | 28 | Quantum Hardware Selection | – | How to automatically select a suitable quantum device to execute a given quantum circuit? |
| 29 | 29 | Quantum Classification | How to train a classifier to assign new data points to one of multiple classes using a quantum devic... | |
| 30 | 30 | Quantum Neural Network (QNN) | Not available | How to learn an unknown unitary operator using a quantum device? |
| 31 | 31 | Hadamard Test | Enter your input for this section here. | How to calculate the expectation value of a unitary operator for a given quantum state? |
| 32 | 32 | SWAP Test | Enter your input for this section here. | How to evaluate how similar two given quantum states are to each other? |
| 33 | 33 | Quantum Fourier Transformation | Enter your input for this section here. | How to extract frequencies from a function using a quantum device? |
| 34 | 34 | Ad-hoc Hybrid Code Execution | – | How to execute quantum circuits with classical pre- and post-processing steps with no additional dep... |
| 35 | 35 | Classical-Quantum Interface | – | How can a quantum algorithm implementation be used by developers without quantum computing knowledge... |
| 36 | 36 | Hybrid Module | – | How can the implementation of a quantum algorithm requiring both classical and quantum computations ... |
| 37 | 37 | Orchestrated Execution | – | How to ensure the control and data flow for quantum applications comprising one or more quantum circ... |
| 38 | 38 | Pre-deployed Execution | – | How to execute quantum circuits with classical pre- and post-processing steps that have custom deplo... |
| 39 | 39 | Mid-Circuit Measurement | Enter your input for this section here. | How to extract partial information from a quantum device while a circuit execution is still running? |
| 40 | 40 | Dynamic Circuit | Enter your input for this section here. | How to modify a quantum computation during runtime based on intermediate information about a part of... |
| 41 | 41 | Prioritized Execution | – | How to execute multiple quantum circuits in succession while keeping the queuing time low? |
| 42 | 42 | Quantum Circuit Translator | – | How can a quantum circuit be executed by different quantum computers with different instruction sets... |
| 43 | 43 | Quantum Module | – | How can the implementation of the quantum part of a quantum algorithm be packaged for reuse independ... |
| 44 | 44 | Quantum Module Template | – | How can the implementation of the quantum part of a quantum algorithm be packaged for reuse when som... |
| 45 | 45 | Readout Error Mitigation | Enter your input for this section here. | How to reduce the impact of erroneous measurements such that the measured result is closer to the in... |
| 46 | 46 | Quantum Approximate Optimization Algorithm (QAOA) | Approximate the solution of an optimization problem [Weigold et al. 2021](https://www.springer.com/d... | |
| 47 | 47 | Standalone Circuit Execution | – | How to execute standalone quantum circuits that impose no deployment or integration requirements? |
| 48 | 48 | Wire Cut | Enter your input for this section here. | How to interrupt a wire in a quantum circuit classically such that no quantum information is transmi... |
| 49 | 49 | Gate Cut | Enter your input for this section here. | How to partition a multi-qubit gate into independent gates while preserving the computation's result... |
| 50 | 50 | Variational Quantum Eigensolver (VQE) | An alias for this pattern is Quantum Variational Eigensolver (QVE) (Mitarai et al. 2018). | "Approximate the lowest eigenvalue of a matrix" [(Weigold et al. 2021)](https://www.springer.com/de/... |
| 51 | 51 | Warm Start | "Fine-tune an optimization algorithm by warm starting it" [(Weigold et al. 2021)](https://www.spring... | |
| 52 | 52 | Variational Quantum Algorithm (VQA) | "Optimize the parameters of a quantum circuit on a classical computer" [(Weigold et al. 2021)](https... | |
| 53 | 53 | Grover | How can you find a specific element ( \tilde{x} ) within an unsorted database of ( N ) elements? | |
| 54 | 54 | Oracle | This pattern has also been referred to as Black Box. | Re-use a computation of a quantum algorithm without necessarily knowing the implementation. |
| 55 | 55 | Quantum Associative Memory (QuAM) | Enter your input for this section here. | Encode data in a compact manner that do not require calculations |
| 56 | 56 | Quantum-Classic Split | Enter your input for this section here. | Split computational tasks into a quantum part running on a quantum computer and a classical part run... |
| 57 | 57 | Quantum Random Access Memory (QRAM) Encoding | Enter your input for this section here. | "Use a quantum random access memory to access a superposition of data values at once" [(Weigold et a... |
| 58 | 58 | Quantum Phase Estimation (QPE) | Phase estimation algorithm (PEA) | Approximate the eigenvalue of a unitary matrix. |
| 59 | 59 | Speedup via Verifying | Achieve a computational speedup on computation when verification of a solution is simple. |
References¶
@online{PlanQK_QuantumPatterns_2024, author = {{PlanQK}}, title = {Quantum Computing Patterns}, year = {2025}, url = {https://patternatlas.planqk.de/pattern-languages/af7780d5-1f97-4536-8da7-4194b093ab1d}, urldate = {2025-09-28} }
This document was automatically generated from the experimental data files.