Projects
Open source computing projects and contributions
Sequential Quantum Gate Decomposer (SQUANDER)
C++ / PythonA high-performance quantum gate decomposer and compiler for optimizing quantum circuits. SQUANDER provides efficient algorithms for decomposing arbitrary quantum gates into native gate sets and optimizing quantum circuit implementations.
Key Features:
- •Efficient quantum gate decomposition into native gate sets
- •Quantum circuit optimization and compilation algorithms
- •Support for various quantum computing architectures
- •High-performance C++ backend with Python interface
Piquasso
Python / C++A photonic quantum computing simulator for continuous-variable quantum computation. Piquasso enables simulation of quantum optical systems, boson sampling, and Gaussian state quantum computing with both Fock and Gaussian state representations.
Key Features:
- •Photonic quantum computing simulation in Fock and Gaussian spaces
- •Boson sampling and continuous-variable quantum algorithms
- •Support for deterministic and probabilistic quantum gates
EQuUs: Eötvös Quantum Transport Utilities
MatlabEötvös Quantum Transport Utilities (EQuUs) - A collection of computational tools for theoretical investigation of quantum transport phenomena in solid state systems. The utilities support research on mesoscopic systems, carbon-based materials, and quantum transport properties.
Key Features:
- •Quantum transport calculations for mesoscopic and nanoscale systems
- •Support for carbon-based materials (graphene, nanotubes, dichalcogenides)
- •Numerical computation tools for quantum transport phenomena
- •Utilities including adaptiveQ, SNSJosephson, and Ribbon for specialized calculations
Highly optimized quantum circuits synthesized via data-flow engines
ResearchThis work demonstrates the use of Field Programmable Gate Array (FPGA) based data-flow engines (DFEs) to scale up variational quantum compilers for synthesizing circuits up to 9-qubit programs. The gate decomposer utilizes a newly developed DFE quantum computer simulator designed to simulate arbitrary quantum circuits consisting of single qubit rotations and controlled two-qubit gates on FPGA chips.
Key Features:
- •FPGA-based data-flow engines for scaling variational quantum compilers
- •DFE quantum computer simulator for arbitrary quantum circuits on FPGA
- •Synthesizes circuits up to 9-qubit programs with high fidelity
- •97% average depth reduction compared to QISKIT while maintaining near-unity fidelity
Accelerated boson sampling simulations using FPGA-based data-flow engines
ResearchThis work generalizes the Balasubramanian–Bax–Franklin–Glynn permanent formula to efficiently integrate it into boson sampling strategies. By incorporating n-ary Gray code ordering of addends during permanent evaluation, we achieve a reduction in simulation complexity. Implementing the algorithm on FPGA-based data-flow engines enables acceleration of boson sampling simulations for up to 40 photons, drawing samples from a 60-mode interferometer at an average rate of 80 seconds per sample using 4 FPGA chips.
Key Features:
- •Generalized permanent formula for efficient boson sampling simulation
- •n-ary Gray code ordering reduces simulation complexity from photon occupation multiplicities
- •FPGA-based implementation accelerates simulations up to 40 photons
- •Supports both ideal and lossy boson sampling experiments with 60-mode interferometer
Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training
ResearchThis work introduces a novel optimization approach designed to alleviate the adverse effects of barren plateaus (BP) during variational quantum circuit training. In contrast to conventional gradient descent methods, our approach relies on making finite hops along search directions determined on randomly chosen subsets of free parameters. The optimization search direction and range are determined by distant features of the cost-function landscape, enabling navigation around barren plateaus without external control mechanisms. Successfully applied to quantum circuits comprising 21 qubits and 15,000 entangling gates, demonstrating robust resistance against BPs.
Key Features:
- •Novel optimization strategy to navigate around barren plateaus in variational quantum algorithms
- •Finite hops along search directions on randomly chosen parameter subsets
- •Successfully tested on circuits with 21 qubits and 15,000 entangling gates
- •Evolutionary selection framework enhances ability to avoid local minima in quantum gate synthesis