Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Experimental protocol Fast Intermediate Measurement in a Three Qubit Adaptive Receiver

Peter M Austin

Published Nov 13, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.19217.60000

Related papers

A Three-Qubit Coherent Receiver: Experimental Proposal and Resource Benchmarks

Peter M Austin

•Nov 9, 2026•0 citations

Adaptive thresholding for scalable measurement-based qubit reset

Qian Cao, Unnati Akhouri, Samuel Vizvary +3 more

Fast, high-fidelity qubit initialization is a key primitive for scalable quantum information processing, but conventional reset protocols either require long relaxation times or discard information contained in continuous measurement records. We demonstrate an adaptive measurement-based reset protocol for superconducting qubits that uses Bayesian inference to update the qubit-state estimate after each readout and dynamically adjust the feedback threshold. Unlike fixed-threshold or repeat-until-success (RUS) protocols, the method utilizes the full analog measurement history, enabling the reset decision to become progressively more conservative as confidence in ground-state preparation increases. Implemented with real-time FPGA-based feedback on a dispersively readout transmon qubit, the protocol achieves a ground-state initialization fidelity of $99.44\pm0.04\%$ after a small number of reset rounds. We further compare adaptive reset with RUS strategies in multi-qubit experiments and show that adaptive thresholding provides deterministic reset duration while maintaining a five-qubit simultaneous-reset fidelity of $98.78 \pm 0.19\%$. These results establish Bayesian adaptive thresholding as a practical and scalable route to fast qubit reset in superconducting quantum processors.

quant-pharXiv:2609.25208•Sep 23, 2026•0 citations

A secure crossing two qubits protocol based on quantum homomorphic encryption

Zhen-Wen Cheng, Xiu‐Bo Chen, Gang Xu +3 more

Abstract In order to solve the information leakage caused by dishonest intermediate nodes in quantum network coding, we apply quantum homomorphic encryption to the butterfly network, and propose a secure protocol for crossing two qubits. Firstly, in the communication process between two senders and the first intermediate node, two senders encrypt their measured particles and send them to the first intermediate node for encoding. If two intermediate nodes are dishonest and know the encryption rules between two senders and two receivers, or there is an external eavesdropper, none of them can recover the transmitted qubits of two senders from the encrypted transmitted particles. In this way, our protocol can transmit two qubits safely and crossly in the butterfly network. Secondly, by analyzing the internal participant attack and the external eavesdropper attack launched by dishonest intermediate nodes and an external eavesdropper respectively, it is confirmed that our protocol is secure. Finally, the experimental simulation results based on the Qiskit framework prove that our protocol is feasible.

Quantum Science and Technology•Mar 4, 2022•20 citations

Experimental Results for a Three Qubit Coherent Receiver

Peter M Austin

•Nov 10, 2026•0 citations

Unbounded advantage of adaptivity in entanglement-assisted communication

Armin Tavakoli

Shared entanglement can reduce the amount of classical communication needed to perform distributed computation. This can be achieved either by first measuring the entanglement and then communicating classically, or by adapting the quantum measurement to the received message. Here, we introduce tasks that adaptive protocols can solve using just three entanglement-assisted messages, while the communication cost grows without bound when the quantum receiver is not adaptive. Consequently, no bounded amount of classical communication can reproduce all correlations generated by an entanglement-assisted ternary classical channel. We establish two complementary limitations on the relation between adaptive and non-adaptive quantum protocols. First, every adaptive protocol using a finite entanglement dimension admits a non-adaptive simulation at finite communication cost. Second, every adaptive protocol sending $d$ messages can be simulated to within error $\varepsilon$ using $O(d\log(1/\varepsilon))$ non-adaptive messages. Our results reveal the fundamentally unbounded advantage of adaptivity in quantum communication, but also that observing very large advantages requires both high-dimensional entanglement and very precise observations.

arXiv:2611.11333•Nov 8, 2026•0 citations

Fast storage and processing of qubit measurements

Diego Ristè, Brian Donovan, Guilhem J. Ribeill +7 more

Bulletin of the American Physical Society•Mar 9, 2018•0 citations
Fast, high-fidelity qubit initialization is a key primitive for scalable quantum information processing, but conventional reset protocols either require long relaxation times or discard information contained in continuous measurement records. We demonstrate an adaptive measurement-based reset protocol for superconducting qubits that uses Bayesian inference to update the qubit-state estimate after each readout and dynamically adjust the feedback threshold. Unlike fixed-threshold or repeat-until-success (RUS) protocols, the method utilizes the full analog measurement history, enabling the reset decision to become progressively more conservative as confidence in ground-state preparation increases. Implemented with real-time FPGA-based feedback on a dispersively readout transmon qubit, the protocol achieves a ground-state initialization fidelity of 99.44±0.04%99.44\pm0.04\%99.44±0.04% after a small number of reset rounds. We further compare adaptive reset with RUS strategies in multi-qubit experiments and show that adaptive thresholding provides deterministic reset duration while maintaining a five-qubit simultaneous-reset fidelity of 98.78±0.19%98.78 \pm 0.19\%98.78±0.19%. These results establish Bayesian adaptive thresholding as a practical and scalable route to fast qubit reset in superconducting quantum processors.
Abstract In order to solve the information leakage caused by dishonest intermediate nodes in quantum network coding, we apply quantum homomorphic encryption to the butterfly network, and propose a secure protocol for crossing two qubits. Firstly, in the communication process between two senders and the first intermediate node, two senders encrypt their measured particles and send them to the first intermediate node for encoding. If two intermediate nodes are dishonest and know the encryption rules between two senders and two receivers, or there is an external eavesdropper, none of them can recover the transmitted qubits of two senders from the encrypted transmitted particles. In this way, our protocol can transmit two qubits safely and crossly in the butterfly network. Secondly, by analyzing the internal participant attack and the external eavesdropper attack launched by dishonest intermediate nodes and an external eavesdropper respectively, it is confirmed that our protocol is secure. Finally, the experimental simulation results based on the Qiskit framework prove that our protocol is feasible.
Shared entanglement can reduce the amount of classical communication needed to perform distributed computation. This can be achieved either by first measuring the entanglement and then communicating classically, or by adapting the quantum measurement to the received message. Here, we introduce tasks that adaptive protocols can solve using just three entanglement-assisted messages, while the communication cost grows without bound when the quantum receiver is not adaptive. Consequently, no bounded amount of classical communication can reproduce all correlations generated by an entanglement-assisted ternary classical channel. We establish two complementary limitations on the relation between adaptive and non-adaptive quantum protocols. First, every adaptive protocol using a finite entanglement dimension admits a non-adaptive simulation at finite communication cost. Second, every adaptive protocol sending ddd messages can be simulated to within error ε\varepsilonε using O(dlog⁡(1/ε))O(d\log(1/\varepsilon))O(dlog(1/ε)) non-adaptive messages. Our results reveal the fundamentally unbounded advantage of adaptivity in quantum communication, but also that observing very large advantages requires both high-dimensional entanglement and very precise observations.