Responsive Operations for Key Services (ROKS): A Modular, Low SWaP Quantum Communications Payload

Craig D. Colquhoun; Hazel Jeffrey; Steve Greenland; Sonali Mohapatra; Colin Aitken; Mikulas Cebecauer; Charlotte Crawshaw; Kenny Jeffrey; Toby Jeffreys; Philippos Karagiannakis; Ahren McTaggart; Caitlin Stark; Jack Wood; Siddarth K. Joshi; Jaya Sagar; Elliott Hastings; Peide Zhang; Milan Stefko; David Lowndes; John G. Rarity; Jasminder S. Sidhu; Thomas Brougham; Duncan McArthur; Robert G. Pousa; Daniel K. L. Oi; Matthew Warden; Eilidh Johnston; John Leck

arXiv · 2210.11285

Responsive Operations for Key Services (ROKS): A Modular, Low SWaP Quantum Communications Payload

View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum key distribution (QKD) is a theoretically proven future-proof secure encryption method that inherits its security from fundamental physical principles. Craft Prospect, working with a number of UK organisations, has been focused on miniaturising the technologies that enable QKD so that they may be used in smaller platforms including nanosatellites. The significant reduction of size, and therefore the cost of launching quantum communication technologies either on a dedicated platform or hosted as part of a larger optical communications will improve potential access to quantum encryption on a relatively quick timescale. The ROKS mission seeks to be among the first to send a QKD payload on a CubeSat into low Earth orbit, demonstrating the capabilities of newly developed modular quantum technologies. The ROKS payload comprises a quantum source module that supplies photons randomly in any of four linear polarisation states fed from a quantum random number generator; an acquisition, pointing, and tracking system to fine-tune alignment of the quantum source beam with an optical ground station; an imager that will detect cloud cover autonomously; and an onboard computer that controls and monitors the other modules, which manages the payload and assures the overall performance and security of the system. Each of these modules have been developed with low SWaP for CubeSats, but with interoperability in mind for other satellite form factors. We present each of the listed components, together with the initial test results from our test bench and the performance of our protoflight models prior to initial integration with the 6U CubeSat platform systems. The completed ROKS payload will be ready for flight at the end of 2022, with various modular components already being baselined for flight and integrated into third party communication missions.

Explore related subjects

quant-ph

Keep this discovery

BibTeX RIS

Craig D. Colquhoun, Hazel Jeffrey, Steve Greenland, Sonali Mohapatra, Colin Aitken, Mikulas Cebecauer, Charlotte Crawshaw, Kenny Jeffrey, Toby Jeffreys, Philippos Karagiannakis, Ahren McTaggart, Caitlin Stark, Jack Wood, Siddarth K. Joshi, Jaya Sagar, Elliott Hastings, Peide Zhang, Milan Stefko, David Lowndes, John G. Rarity, Jasminder S. Sidhu, Thomas Brougham, Duncan McArthur, Robert G. Pousa, Daniel K. L. Oi, Matthew Warden, Eilidh Johnston, John Leck. 2022-10-20. Responsive Operations for Key Services (ROKS): A Modular, Low SWaP Quantum Communications Payload. https://arxiv.org/abs/2210.11285

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗

arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗

arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗