Qyantram: A Transparent and Verifiable Quantum Computing Platform
Abstract
Most quantum circuit platforms focus on idealized circuit assembly and simulation, hiding hardware compilation, error identification, and variational model training behind black-box operations. QYANTRAM addresses this gap through an open platform comprising four subsystems, built around evidence-backed results and independent verification. Its staged compilation pipeline makes every transformation traceable, while the router publishes rejected SWAP candidates and their scores for transparent decision-making. Verification exploits inactive qubits remaining in the |0> state, reducing complexity from 2^N to 2^k for k active qubits. This mathematically exact reduction enables full pre-compilation verification on 127- and 156-qubit layouts, achieving approximately 10,000x speed-ups with execution times below one millisecond. The error identification engine exhaustively evaluates all Pauli error patterns without sampling, matching closed-form predictions within 2.8e-17. Its machine-learning engine achieves numerical agreement within 2.0e-15 of qiskit.quantum_info while training 25-50 times faster. The router introduces approximately 1.27x more SWAP gates than Qiskit's SABRE due to its omission of optimization, trading routing efficiency for complete decision transparency and traceability.
Related
- Dual-unitary Circuits as a Platform for Quantum Reservoir Computing
- Q-MAP: Multi-Platform Benchmarking of Distributed Quantum Computing for Coherent Controlled Islanding
- Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation
- Verifiable Sampling for Delegated Generative Quantum Machine Learning
- Motzkin-Straus Optimization on an Entropy-Computing Platform
BibTeX
@misc{kekane2026qyantram,
title = {{Qyantram: A Transparent and Verifiable Quantum Computing Platform}},
author = {Sharyu Kekane and Sadique Khatib and Abhushan Bokade and Uday Wad and S. M. Kamalapur and Y. D. Bhise},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.03262},
eprint = {2611.03262},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.03262},
}
RIS
TY - UNPB
TI - Qyantram: A Transparent and Verifiable Quantum Computing Platform
AU - Sharyu Kekane
AU - Sadique Khatib
AU - Abhushan Bokade
AU - Uday Wad
AU - S. M. Kamalapur
AU - Y. D. Bhise
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.03262
UR - https://arxiv.org/abs/2611.03262
AB - Most quantum circuit platforms focus on idealized circuit assembly and simulation, hiding hardware compilation, error identification, and variational model training behind black-box operations. QYANTRAM addresses this gap through an open platform comprising four subsystems, built around evidence-backed results and independent verification. Its staged compilation pipeline makes every transformation traceable, while the router publishes rejected SWAP candidates and their scores for transparent decision-making. Verification exploits inactive qubits remaining in the |0> state, reducing complexity from 2^N to 2^k for k active qubits. This mathematically exact reduction enables full pre-compilation verification on 127- and 156-qubit layouts, achieving approximately 10,000x speed-ups with execution times below one millisecond. The error identification engine exhaustively evaluates all Pauli error patterns without sampling, matching closed-form predictions within 2.8e-17. Its machine-learning engine achieves numerical agreement within 2.0e-15 of qiskit.quantum_info while training 25-50 times faster. The router introduces approximately 1.27x more SWAP gates than Qiskit's SABRE due to its omission of optimization, trading routing efficiency for complete decision transparency and traceability.
ER -