There's an obvious extension of ZMask() to "masked" S, T, and general PhaseRootN gates.ZMask() calculates parity of each masked permutation, and applies a -1 multiplicative factor if the parity is odd, achieving a batched set of masked Pauli Z gates. Similarly, for a general batched PhaseRootN gate, the effective extension of this parity calculation is to a ring with 2^(n+1) phas
A small package for numerical simulation of quantum systems. Created as an alternative to qutip due to code generation limitations in the latter. It was an amusing experiment in code generation, but now Tensorflow and Theano support complex sparse matrices, so you can just use them with a bit of a wrapper. Or QuantumOptics.jl in Julia.
A collection of Jupyter Notebooks with explanations, insights, tutorials, exercises and showing how to use the Qiskrypt software suite, built using the IBM’s open-source Software Development Kit for quantum computing Qiskit. 📚👨🏫
The Qis|krypt⟩ is a software suite of protocols of quantum cryptography and quantum communications, as well, other protocols and algorithms, built using IBM’s open-source Software Development Kit for quantum computing Qiskit. ⚛️🔐
A Quantum Simulator program utilizing matrix operations to simulate a quantum system capable of reproducing pseudo fundamentals of superposition and entanglement.
This repository contains the source code of MPI programs for simulating quantum algorithms and for post-processing the output from these algorithms. The focus is on Shor's groundbreaking algorithms, and on the various derivatives of Shor's algorithms.
There's an obvious extension of
ZMask()to "masked"S,T, and generalPhaseRootNgates.ZMask()calculates parity of each masked permutation, and applies a-1multiplicative factor if the parity is odd, achieving a batched set of masked PauliZgates. Similarly, for a general batchedPhaseRootNgate, the effective extension of this parity calculation is to a ring with2^(n+1)phas