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

arXiv:2510.08313

Characterizing Space-Constrained Implementability of Quantum Instruments via Signaling Conditions

Matsui, Kosuke, Jun-Yi Wu, Hayata Yamasaki, Min-Hsiu Hsieh, Mio Murao

Published Oct 9, 2025• 1 citation
arXivHTMLPDF

Abstract

Scaling up the number of qubits available on quantum processors remains technically demanding even in the long term; it is therefore crucial to clarify the number of qubits required to implement a given quantum operation. For the most general class of quantum operations, known as quantum instruments, the qubit requirements are not well understood, especially when mid-circuit measurements and delayed input preparation are permitted. In this work, we characterize lower and upper bounds on the number of qubits required to implement a given quantum instrument in terms of the causal structure of the instrument. We further apply our results to entanglement distillation protocols based on stabilizer codes and show that, in these cases, the lower and upper bounds coincide, so the optimal qubit requirement is determined. In particular, we compute that the optimal number of qubits is 3 for the $[[9,1,3]]$-code-based protocol and 4 for the $[[5,1,3]]$-code-based protocol.

DOI
10.48550/arxiv.2510.08313

Related papers

Sequential realization of Quantum Instruments

Soham Sau, Michal Sedlák

In adaptive quantum circuits classical results of mid-circuit measurements determine the upcoming gates. This allows POVMs, quantum channels or more generally quantum instruments to be implemented sequentially, so that fewer qubits need to be used at each of the $N$ measurement steps. In this paper, we mathematically describe these problems via adaptive sequence of instruments (ASI) and show how any instrument can be decomposed into it. Number of steps $N$ and number of ancillary qubits $n_A$ needed for actual implementation are crucial parameters of any such ASI. We show an achievable lower bound on the product $N.n_A$ and we determine in which situations this tradeoff is likely to be optimal. Contrary to common intuition we show that for quantum instruments which transform $n$ to $m(>n)$ qubits, there exist $N$-step ASI implementing them just with $(m-n)$ ancillary qubits, which are remeasured $(N-1)$ times and finally used as output qubits.

quant-pharXiv:2512.14588•Quantum•Dec 17, 2025•1 citation

Communication Complexity of Distributed Unitary Synthesis

Longcheng Li, Xiaoming Sun, Jialin Zhang +1 more

We study space-bounded communication complexity for unitary implementation in distributed quantum processors, where we restrict the number of qubits per processor to ensure practical relevance and technical non-triviality. We model distributed quantum processors using distributed quantum circuits with nonlocal two-qubit gates, defining the distributed communication complexity of a unitary as the minimum number of such nonlocal gates required for its realization, up to permutations of data qubit positions. Our contributions are twofold. First, for general $n$-qubit unitaries, we improve upon the trivial $O(4^n)$ communication bound. Considering $k$ pairwise-connected processors (each with $n/k$ data qubits and $m$ ancillas), we prove the communication complexity satisfies $O\left(\max\{4^{(1-1/k)n - m}, n\}\right)$ -- for example, $O(2^n)$ when $m=0$ and $k=2$ -- and establish the tightness of this upper bound. We further extend the analysis to approximation models and general network topologies. Second, for special unitaries, we show that both the Quantum Fourier Transform (QFT) and Clifford circuits admit linear upper bounds on communication complexity in the exact model, outperforming the trivial quadratic bounds applicable to these cases. In the approximation model, QFT's communication complexity reduces drastically from linear to logarithmic, while Clifford circuits retain a linear lower bound. These results offer fundamental insights for optimizing communication in distributed quantum unitary implementation, advancing the feasibility of large-scale DQC systems.

quant-pharXiv:2511.04250•IEEE Transactions on Information Theory•Nov 7, 2025•1 citation

Improvement of Stabilizer-Based Entanglement Distillation Protocols by Encoding Operators

Shun Watanabe, Matsumoto, R, Uyematsu, T

We show a class of encoding operators for a quantum stabilizer code such that the number of gates of the inverse encoding quantum circuit is O(nk), where k qubits are encoded into n qubits by the stabilizer code. Then, we demonstrate that the performances of two-way EDPs are improved by the different choice of inverse encoding operators from the class of inverse encoding operators proposed in this paper. As an example, we show the best EDP among currently known two-way EDPs for the wide range of fidelity.

•Jun 7, 2005•7 citations

A Framework for Quantum Circuit Optimization: Comparators as a Case Study

Francisco José Orts, Rodrigo Gil-Merino

Qubits are the minimum unit of information in quantum computing. As current quantum devices have a very limited number of available qubits, finding circuits that optimize their use is crucial for this computing paradigm. Optimizing the qubits needed to implement a quantum circuit is not trivial, as these circuits have important restrictions such as the impossibility of copying values or the requirement that the computation done in them must always be reversible. This paper presents a framework for optimizing circuits for quantum computing. The framework is able to obtain, given a quantum circuit, an equivalent one that is more efficient in terms of number of qubits. In particular, the framework has applicability in quantum circuits dedicated to arithmetic operations such as addition or multiplication. As a representative case study, it is applied to a reversible comparator circuit, obtaining a design that reduces the number of qubits and controlled gates compared to other reversible comparators reported in the recent literature. As part of the work, a public repository is included with the necessary code to simplify any other circuit.

IEEE Transactions on Computers•Dec 12, 2025•0 citations

Quantum circuits for quantum channels

Raban Iten, Roger Colbeck, Matthias Christandl

We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of controlled-not (cnot) gates required (single-qubit gates are free). We consider three different models. In the first, the quantum circuit model (QCM), we consider sequences of single-qubit and cnot gates and allow qubits to be traced out at the end of the gate sequence. In the second (RandomQCM), we also allow external classical randomness. In the third (MeasuredQCM) we also allow measurements followed by operations that are classically controlled on the outcomes. We prove lower bounds on the number of cnot gates required and give near-optimal decompositions in almost all cases. Our main result is a MeasuredQCM circuit for any channel from $m$ qubits to $n$ qubits that uses at most one ancilla and has a low cnot count. We give explicit examples for small numbers of qubits that provide the lowest known cnot counts.

arXiv:1609.08103•Physical Review A•May 9, 2017•35 citations

Learning unknown stabilizer codes using product measurements

Heather Leitch, Sri. S. Tirukkovalluri, Yingkai Ouyang

Efficiently characterizing quantum error correcting codes is a key challenge on the path to fault-tolerant quantum computation. Stabilizer codes, a central class of such codes, are defined by a set of stabilizer generators. Here, we present an algorithm that uses random single-qubit measurements to learn the stabilizer generators of any stabilizer code from $N$ copies of stabilizer states in its codespace, requiring no prior knowledge of the code's structure. This also enables verification that a device implements its intended code. We derive a lower bound on $N$ needed to recover the stabilizer generators with high probability, together with a bound on the algorithm's overall probability of success. When applied to quantum low-density parity-check (qLDPC) codes, a leading candidate for practical fault-tolerant architectures, our approach requires a number of states that scales polylogarithmically with $n$, the number of qubits.

quant-pharXiv:2609.04997•Sep 7, 2026•2 citations
Scaling up the number of qubits available on quantum processors remains technically demanding even in the long term; it is therefore crucial to clarify the number of qubits required to implement a given quantum operation. For the most general class of quantum operations, known as quantum instruments, the qubit requirements are not well understood, especially when mid-circuit measurements and delayed input preparation are permitted. In this work, we characterize lower and upper bounds on the number of qubits required to implement a given quantum instrument in terms of the causal structure of the instrument. We further apply our results to entanglement distillation protocols based on stabilizer codes and show that, in these cases, the lower and upper bounds coincide, so the optimal qubit requirement is determined. In particular, we compute that the optimal number of qubits is 3 for the [[9,1,3]][[9,1,3]][[9,1,3]]-code-based protocol and 4 for the [[5,1,3]][[5,1,3]][[5,1,3]]-code-based protocol.
In adaptive quantum circuits classical results of mid-circuit measurements determine the upcoming gates. This allows POVMs, quantum channels or more generally quantum instruments to be implemented sequentially, so that fewer qubits need to be used at each of the NNN measurement steps. In this paper, we mathematically describe these problems via adaptive sequence of instruments (ASI) and show how any instrument can be decomposed into it. Number of steps NNN and number of ancillary qubits nAn_AnA​ needed for actual implementation are crucial parameters of any such ASI. We show an achievable lower bound on the product N.nAN.n_AN.nA​ and we determine in which situations this tradeoff is likely to be optimal. Contrary to common intuition we show that for quantum instruments which transform nnn to m(>n)m(>n)m(>n) qubits, there exist NNN-step ASI implementing them just with (m−n)(m-n)(m−n) ancillary qubits, which are remeasured (N−1)(N-1)(N−1) times and finally used as output qubits.
We study space-bounded communication complexity for unitary implementation in distributed quantum processors, where we restrict the number of qubits per processor to ensure practical relevance and technical non-triviality. We model distributed quantum processors using distributed quantum circuits with nonlocal two-qubit gates, defining the distributed communication complexity of a unitary as the minimum number of such nonlocal gates required for its realization, up to permutations of data qubit positions. Our contributions are twofold. First, for general nnn-qubit unitaries, we improve upon the trivial O(4n)O(4^n)O(4n) communication bound. Considering kkk pairwise-connected processors (each with n/kn/kn/k data qubits and mmm ancillas), we prove the communication complexity satisfies O(max⁡{4(1−1/k)n−m,n})O\left(\max\{4^{(1-1/k)n - m}, n\}\right)O(max{4(1−1/k)n−m,n}) -- for example, O(2n)O(2^n)O(2n) when m=0m=0m=0 and k=2k=2k=2 -- and establish the tightness of this upper bound. We further extend the analysis to approximation models and general network topologies. Second, for special unitaries, we show that both the Quantum Fourier Transform (QFT) and Clifford circuits admit linear upper bounds on communication complexity in the exact model, outperforming the trivial quadratic bounds applicable to these cases. In the approximation model, QFT's communication complexity reduces drastically from linear to logarithmic, while Clifford circuits retain a linear lower bound. These results offer fundamental insights for optimizing communication in distributed quantum unitary implementation, advancing the feasibility of large-scale DQC systems.
We show a class of encoding operators for a quantum stabilizer code such that the number of gates of the inverse encoding quantum circuit is O(nk), where k qubits are encoded into n qubits by the stabilizer code. Then, we demonstrate that the performances of two-way EDPs are improved by the different choice of inverse encoding operators from the class of inverse encoding operators proposed in this paper. As an example, we show the best EDP among currently known two-way EDPs for the wide range of fidelity.
Qubits are the minimum unit of information in quantum computing. As current quantum devices have a very limited number of available qubits, finding circuits that optimize their use is crucial for this computing paradigm. Optimizing the qubits needed to implement a quantum circuit is not trivial, as these circuits have important restrictions such as the impossibility of copying values or the requirement that the computation done in them must always be reversible. This paper presents a framework for optimizing circuits for quantum computing. The framework is able to obtain, given a quantum circuit, an equivalent one that is more efficient in terms of number of qubits. In particular, the framework has applicability in quantum circuits dedicated to arithmetic operations such as addition or multiplication. As a representative case study, it is applied to a reversible comparator circuit, obtaining a design that reduces the number of qubits and controlled gates compared to other reversible comparators reported in the recent literature. As part of the work, a public repository is included with the necessary code to simplify any other circuit.
We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of controlled-not (cnot) gates required (single-qubit gates are free). We consider three different models. In the first, the quantum circuit model (QCM), we consider sequences of single-qubit and cnot gates and allow qubits to be traced out at the end of the gate sequence. In the second (RandomQCM), we also allow external classical randomness. In the third (MeasuredQCM) we also allow measurements followed by operations that are classically controlled on the outcomes. We prove lower bounds on the number of cnot gates required and give near-optimal decompositions in almost all cases. Our main result is a MeasuredQCM circuit for any channel from mmm qubits to nnn qubits that uses at most one ancilla and has a low cnot count. We give explicit examples for small numbers of qubits that provide the lowest known cnot counts.
Efficiently characterizing quantum error correcting codes is a key challenge on the path to fault-tolerant quantum computation. Stabilizer codes, a central class of such codes, are defined by a set of stabilizer generators. Here, we present an algorithm that uses random single-qubit measurements to learn the stabilizer generators of any stabilizer code from NNN copies of stabilizer states in its codespace, requiring no prior knowledge of the code's structure. This also enables verification that a device implements its intended code. We derive a lower bound on NNN needed to recover the stabilizer generators with high probability, together with a bound on the algorithm's overall probability of success. When applied to quantum low-density parity-check (qLDPC) codes, a leading candidate for practical fault-tolerant architectures, our approach requires a number of states that scales polylogarithmically with nnn, the number of qubits.