n-Qubit Operations on Sphere and Queueing Scaling Limits for Programmable Quantum Computer

Abstract

We study n-qubit operation rules on (n+1)-sphere with the target to help developing a (photon or other technique) based programmable quantum computer. In the meanwhile, we derive the scaling limits (called reflecting Gaussian random fields on a (n+1)-sphere) for n-qubit quantum computer based queueing systems under two different heavy traffic regimes. The queueing systems are with multiple classes of users and batch quantum random walks over the $(n+1)$-sphere as arrival inputs. In the first regime, the qubit number $n$ is fixed and the scaling is in terms of both time and space. Under this regime, performance modeling during deriving the scaling limit in terms of balancing the arrival and service rates under first-in first-out and work conserving service policy is conducted. In the second regime, besides the time and space scaling parameters, the qubit number $n$ itself is also considered as a varying scaling parameter with the additional aim to find a suitable number of qubits for the design of a quantum computer. This regime is in contrast to the well-known Halfin-Whitt regime.

arXiv comment24 pages, 4 figures

References in corpus (20)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Quantum random walks - an introductory overview
• Quantum Computational Supremacy
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Cryogenic Control Architecture for Large-Scale Quantum Computing
• Quantum Blockchain using entanglement in time
• Quantum walks with random phase shifts
• Experimental Implementation of Quantum Walks on IBM Quantum Computers
• Quantum teleportation of physical qubits into logical code-spaces
• CMOS Quantum Computing: Toward A Quantum Computer System-on-Chip
• Hermitian spin-orbit Hamiltonians on a surface in orthogonal curvilinear coordinates: a new practical approach
• The Classical Capacity of Additive Quantum Queue-Channels
• Dynamic Quantum Games
• Numerical Methods and Analysis via Random Field Based Malliavin Calculus for Backward Stochastic PDEs
• Three paths toward the quantum angle operator
• Simplifying Continuous-Time Quantum Walks on Dynamic Graphs
• Optimal approximation to unitary quantum operators with linear optics
• A model for quantum queue
• Optimal Rate Scheduling via Utility-Maximization for J-User MIMO Markov Fading Wireless Channels with Cooperation