Pub Date : 2026-02-10DOI: 10.22331/q-2026-02-10-2002
Roozbeh Bassirian, Adam Bouland, Bill Fefferman, Sam Gunn, Avishay Tal
Certified randomness has a long history in quantum information, with many potential applications. Recently Aaronson and Hung proposed a novel public certified randomness protocol based on existing random circuit sampling (RCS) experiments. The security of their protocol, however, relies on non-standard complexity-theoretic conjectures which were not previously studied in the literature.
Inspired by this work, we study certified randomness in the quantum random oracle model (QROM). We show that quantum Fourier Sampling can be used to define a publicly verifiable certified randomness protocol with black-box security without any computational assumptions. In addition to giving a certified randomness protocol in the QROM, our work can also be seen as supporting Aaronson and Hung's conjectures for RCS-based randomness generation, as our protocol is in some sense the "black-box version" of Aaronson and Hung's protocol. In further support of Aaronson and Hung's proposal, we prove a Fourier Sampling version of Aaronson and Hung's conjecture by extending Raz and Tal's separation of BQP vs PH.
Our work complements the subsequent certified randomness protocol of Yamakawa and Zhandry (2022) in the QROM. Whereas the security of that protocol relied on the Aaronson-Ambainis conjecture, ours does not rely on any computational assumption – at the expense of requiring exponential-time classical verification. Our protocol also has a simple heuristic implementation.
{"title":"On Certified Randomness from Fourier Sampling or Random Circuit Sampling","authors":"Roozbeh Bassirian, Adam Bouland, Bill Fefferman, Sam Gunn, Avishay Tal","doi":"10.22331/q-2026-02-10-2002","DOIUrl":"https://doi.org/10.22331/q-2026-02-10-2002","url":null,"abstract":"Certified randomness has a long history in quantum information, with many potential applications. Recently Aaronson and Hung proposed a novel public certified randomness protocol based on existing random circuit sampling (RCS) experiments. The security of their protocol, however, relies on non-standard complexity-theoretic conjectures which were not previously studied in the literature.<br/>\u0000<br/> Inspired by this work, we study certified randomness in the quantum random oracle model (QROM). We show that quantum Fourier Sampling can be used to define a publicly verifiable certified randomness protocol with black-box security without any computational assumptions. In addition to giving a certified randomness protocol in the QROM, our work can also be seen as supporting Aaronson and Hung's conjectures for RCS-based randomness generation, as our protocol is in some sense the \"black-box version\" of Aaronson and Hung's protocol. In further support of Aaronson and Hung's proposal, we prove a Fourier Sampling version of Aaronson and Hung's conjecture by extending Raz and Tal's separation of BQP vs PH.<br/>\u0000<br/> Our work complements the subsequent certified randomness protocol of Yamakawa and Zhandry (2022) in the QROM. Whereas the security of that protocol relied on the Aaronson-Ambainis conjecture, ours does not rely on any computational assumption – at the expense of requiring exponential-time classical verification. Our protocol also has a simple heuristic implementation.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"45 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146146747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-10DOI: 10.22331/q-2026-02-10-2003
David Layden, Bradley Mitchell, Karthik Siva
Quantum error mitigation techniques mimic noiseless quantum circuits by running several related noisy circuits and combining their outputs in particular ways. How well such techniques work is thought to depend strongly on how noisy the underlying gates are. Weakly-entangling gates, like $R_{ZZ}(theta)$ for small angles $theta$, can be much less noisy than entangling Clifford gates, like CNOT and CZ, and they arise naturally in circuits used to simulate quantum dynamics. However, such weakly-entangling gates are non-Clifford, and are therefore incompatible with two of the most prominent error mitigation techniques to date: probabilistic error cancellation (PEC) and the related form of zero-noise extrapolation (ZNE). This paper generalizes these techniques to non-Clifford gates, and comprises two complementary parts. The first part shows how to effectively transform any given quantum channel into (almost) any desired channel, at the cost of a sampling overhead, by adding random Pauli gates and processing the measurement outcomes. This enables us to cancel or properly amplify noise in non-Clifford gates, provided we can first characterize such gates in detail. The second part therefore introduces techniques to do so for noisy $R_{ZZ}(theta)$ gates. These techniques are robust to state preparation and measurement (SPAM) errors, and exhibit concentration and sensitivity—crucial statistical properties for many experiments. They are related to randomized benchmarking, and may also be of interest beyond the context of error mitigation. We find that while non-Clifford gates can be less noisy than related Cliffords, their noise is fundamentally more complex, which can lead to surprising and sometimes unwanted effects in error mitigation. Whether this trade-off can be broadly advantageous remains to be seen.
{"title":"Theory of quantum error mitigation for non-Clifford gates","authors":"David Layden, Bradley Mitchell, Karthik Siva","doi":"10.22331/q-2026-02-10-2003","DOIUrl":"https://doi.org/10.22331/q-2026-02-10-2003","url":null,"abstract":"Quantum error mitigation techniques mimic noiseless quantum circuits by running several related noisy circuits and combining their outputs in particular ways. How well such techniques work is thought to depend strongly on how noisy the underlying gates are. Weakly-entangling gates, like $R_{ZZ}(theta)$ for small angles $theta$, can be much less noisy than entangling Clifford gates, like CNOT and CZ, and they arise naturally in circuits used to simulate quantum dynamics. However, such weakly-entangling gates are non-Clifford, and are therefore incompatible with two of the most prominent error mitigation techniques to date: probabilistic error cancellation (PEC) and the related form of zero-noise extrapolation (ZNE). This paper generalizes these techniques to non-Clifford gates, and comprises two complementary parts. The first part shows how to effectively transform any given quantum channel into (almost) any desired channel, at the cost of a sampling overhead, by adding random Pauli gates and processing the measurement outcomes. This enables us to cancel or properly amplify noise in non-Clifford gates, provided we can first characterize such gates in detail. The second part therefore introduces techniques to do so for noisy $R_{ZZ}(theta)$ gates. These techniques are robust to state preparation and measurement (SPAM) errors, and exhibit concentration and sensitivity—crucial statistical properties for many experiments. They are related to randomized benchmarking, and may also be of interest beyond the context of error mitigation. We find that while non-Clifford gates can be less noisy than related Cliffords, their noise is fundamentally more complex, which can lead to surprising and sometimes unwanted effects in error mitigation. Whether this trade-off can be broadly advantageous remains to be seen.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"393 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146146748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-09DOI: 10.22331/q-2026-02-09-1999
Yiyuan Chen, Jonas Helsen, Maris Ozols
The Sachdev–Ye–Kitaev (SYK) model is a prominent model of strongly interacting fermions that serves as a toy model of quantum gravity and black hole physics. In this work, we study the Trotter error and gate complexity of the quantum simulation of the SYK model using Lie–Trotter–Suzuki formulas. Building on recent results by Chen and Brandão [6] — in particular their uniform smoothing technique for random matrix polynomials — we derive bounds on the first- and higher-order Trotter error of the SYK model, and subsequently find near-optimal gate complexities for simulating these models using Lie–Trotter–Suzuki formulas. For the $k$-local SYK model on $n$ Majorana fermions, at time $t$, our gate complexity estimates for the first-order Lie–Trotter–Suzuki formula scales with $tilde{mathcal{O}}(n^{k+frac{5}{2}}t^2)$ for even $k$ and $tilde{mathcal{O}}(n^{k+3}t^2)$ for odd $k$, and the gate complexity of simulations using higher-order formulas scales with $tilde{mathcal{O}}(n^{k+frac{1}{2}}t)$ for even $k$ and $tilde{mathcal{O}}(n^{k+1}t)$ for odd $k$. Given that the SYK model has $Theta(n^k)$ terms, these estimates are close to optimal. These gate complexities can be further improved upon in the context of simulating the time evolution of an arbitrary fixed input state $|psirangle$, leading to a $mathcal{O}(n^2)$-reduction in gate complexity for first-order formulas and $mathcal{O}(sqrt{n})$-reduction for higher-order formulas.
We also apply our techniques to the sparse SYK model, which is a simplified variant of the SYK model obtained by deleting all but a $Theta(n)$ fraction of the terms in a uniformly i.i.d. manner. We find the average (over the random term removal) gate complexity for simulating this model using higher-order formulas scales with $tilde{mathcal{O}}(n^{1+frac{1}{2}} t)$ for even $k$ and $tilde{mathcal{O}}(n^{2} t)$ for odd $k$. Similar to the full SYK model, we obtain a $mathcal{O}(sqrt{n})$-reduction simulating the time evolution of an arbitrary fixed input state $|psirangle$.
Our results highlight the potential of Lie–Trotter–Suzuki formulas for efficiently simulating the SYK and sparse SYK models, and our analytical methods can be naturally extended to other Gaussian random Hamiltonians.
{"title":"Trotter error and gate complexity of the SYK and sparse SYK models","authors":"Yiyuan Chen, Jonas Helsen, Maris Ozols","doi":"10.22331/q-2026-02-09-1999","DOIUrl":"https://doi.org/10.22331/q-2026-02-09-1999","url":null,"abstract":"The Sachdev–Ye–Kitaev (SYK) model is a prominent model of strongly interacting fermions that serves as a toy model of quantum gravity and black hole physics. In this work, we study the Trotter error and gate complexity of the quantum simulation of the SYK model using Lie–Trotter–Suzuki formulas. Building on recent results by Chen and Brandão [6] — in particular their uniform smoothing technique for random matrix polynomials — we derive bounds on the first- and higher-order Trotter error of the SYK model, and subsequently find near-optimal gate complexities for simulating these models using Lie–Trotter–Suzuki formulas. For the $k$-local SYK model on $n$ Majorana fermions, at time $t$, our gate complexity estimates for the first-order Lie–Trotter–Suzuki formula scales with $tilde{mathcal{O}}(n^{k+frac{5}{2}}t^2)$ for even $k$ and $tilde{mathcal{O}}(n^{k+3}t^2)$ for odd $k$, and the gate complexity of simulations using higher-order formulas scales with $tilde{mathcal{O}}(n^{k+frac{1}{2}}t)$ for even $k$ and $tilde{mathcal{O}}(n^{k+1}t)$ for odd $k$. Given that the SYK model has $Theta(n^k)$ terms, these estimates are close to optimal. These gate complexities can be further improved upon in the context of simulating the time evolution of an arbitrary fixed input state $|psirangle$, leading to a $mathcal{O}(n^2)$-reduction in gate complexity for first-order formulas and $mathcal{O}(sqrt{n})$-reduction for higher-order formulas.<br/>\u0000<br/> We also apply our techniques to the sparse SYK model, which is a simplified variant of the SYK model obtained by deleting all but a $Theta(n)$ fraction of the terms in a uniformly i.i.d. manner. We find the average (over the random term removal) gate complexity for simulating this model using higher-order formulas scales with $tilde{mathcal{O}}(n^{1+frac{1}{2}} t)$ for even $k$ and $tilde{mathcal{O}}(n^{2} t)$ for odd $k$. Similar to the full SYK model, we obtain a $mathcal{O}(sqrt{n})$-reduction simulating the time evolution of an arbitrary fixed input state $|psirangle$.<br/>\u0000<br/> Our results highlight the potential of Lie–Trotter–Suzuki formulas for efficiently simulating the SYK and sparse SYK models, and our analytical methods can be naturally extended to other Gaussian random Hamiltonians.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"18 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146138536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-09DOI: 10.22331/q-2026-02-09-2000
Anthony Leverrier
While 2-level systems, aka qubits, are a natural choice to perform a logical quantum computation, the situation is less clear at the physical level. Encoding information in higher-dimensional physical systems can indeed provide a first level of redundancy and error correction that simplifies the overall fault-tolerant architecture. A challenge then is to ensure universal control over the encoded qubits. Here, we explore an approach where information is encoded in an irreducible representation of a finite subgroup of $U(2)$ through an inverse quantum Fourier transform. We illustrate this idea by applying it to the real Pauli group $langle X, Zrangle$ in the bosonic setting. The resulting two-mode Fourier cat code displays good error correction properties and admits an experimentally-friendly universal gate set that we discuss in detail.
{"title":"Bosonic quantum Fourier codes","authors":"Anthony Leverrier","doi":"10.22331/q-2026-02-09-2000","DOIUrl":"https://doi.org/10.22331/q-2026-02-09-2000","url":null,"abstract":"While 2-level systems, aka qubits, are a natural choice to perform a logical quantum computation, the situation is less clear at the physical level. Encoding information in higher-dimensional physical systems can indeed provide a first level of redundancy and error correction that simplifies the overall fault-tolerant architecture. A challenge then is to ensure universal control over the encoded qubits. Here, we explore an approach where information is encoded in an irreducible representation of a finite subgroup of $U(2)$ through an inverse quantum Fourier transform. We illustrate this idea by applying it to the real Pauli group $langle X, Zrangle$ in the bosonic setting. The resulting two-mode Fourier cat code displays good error correction properties and admits an experimentally-friendly universal gate set that we discuss in detail.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"241 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146138510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-09DOI: 10.22331/q-2026-02-09-2001
Hemant Sharma, Kenneth Goodenough, Johannes Borregaard, Filip Rozpędek, Jonas Helsen
Graph states are a powerful class of entangled states with numerous applications in quantum communication and quantum computation. Local Clifford (LC) operations that map one graph state to another can alter the structure of the corresponding graphs, including changing the number of edges. Here, we tackle the associated edge-minimisation problem: finding graphs with the minimum number of edges in the LC-equivalence class of a given graph. Such graphs are called minimum edge representatives (MER) and are crucial for minimising the resources required to create a graph state. We leverage Bouchet's algebraic formulation of LC-equivalence to encode the edge-minimisation problem as an integer linear program (EDM-ILP). We further propose a simulated annealing (EDM-SA) approach guided by the local clustering coefficient for edge minimisation. We identify new MERs for graph states with up to 16 qubits by combining EDM-SA and EDM-ILP. We extend the ILP to weighted-edge minimisation, where each edge has an associated weight, and prove that this problem is NP-complete. Finally, we employ our tools to minimise the resources required to create all-photonic generalised repeater graph states using fusion operations.
{"title":"Minimising the number of edges in LC-equivalent graph states","authors":"Hemant Sharma, Kenneth Goodenough, Johannes Borregaard, Filip Rozpędek, Jonas Helsen","doi":"10.22331/q-2026-02-09-2001","DOIUrl":"https://doi.org/10.22331/q-2026-02-09-2001","url":null,"abstract":"Graph states are a powerful class of entangled states with numerous applications in quantum communication and quantum computation. Local Clifford (LC) operations that map one graph state to another can alter the structure of the corresponding graphs, including changing the number of edges. Here, we tackle the associated edge-minimisation problem: finding graphs with the minimum number of edges in the LC-equivalence class of a given graph. Such graphs are called minimum edge representatives (MER) and are crucial for minimising the resources required to create a graph state. We leverage Bouchet's algebraic formulation of LC-equivalence to encode the edge-minimisation problem as an integer linear program (EDM-ILP). We further propose a simulated annealing (EDM-SA) approach guided by the local clustering coefficient for edge minimisation. We identify new MERs for graph states with up to 16 qubits by combining EDM-SA and EDM-ILP. We extend the ILP to weighted-edge minimisation, where each edge has an associated weight, and prove that this problem is NP-complete. Finally, we employ our tools to minimise the resources required to create all-photonic generalised repeater graph states using fusion operations.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"9 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146138507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-09DOI: 10.22331/q-2026-02-09-1998
Dylan Laplace Mermoud, Andrea Simonetto, Sourour Elloumi
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction of the circuits follows from group-theoretical results, most importantly the Bruhat decomposition of the group generated by the cx gates. These circuits require a number of qubits that scale logarithmically with the permutation dimension, and are therefore employable in near-term applications. We further augment the circuits with ancilla qubits to enlarge their span, and with these we build ansatze to tackle permutation-based optimization problems such as quadratic assignment problems, and graph isomorphisms. The resulting quantum algorithm, QuPer, is competitive with respect to classical heuristics and we could simulate its behavior up to a problem with 256 variables, requiring 20 qubits.
{"title":"Variational quantum algorithms for permutation-based combinatorial problems: Optimal ansatz generation with applications to quadratic assignment problems and beyond","authors":"Dylan Laplace Mermoud, Andrea Simonetto, Sourour Elloumi","doi":"10.22331/q-2026-02-09-1998","DOIUrl":"https://doi.org/10.22331/q-2026-02-09-1998","url":null,"abstract":"We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction of the circuits follows from group-theoretical results, most importantly the Bruhat decomposition of the group generated by the cx gates. These circuits require a number of qubits that scale logarithmically with the permutation dimension, and are therefore employable in near-term applications. We further augment the circuits with ancilla qubits to enlarge their span, and with these we build ansatze to tackle permutation-based optimization problems such as quadratic assignment problems, and graph isomorphisms. The resulting quantum algorithm, QuPer, is competitive with respect to classical heuristics and we could simulate its behavior up to a problem with 256 variables, requiring 20 qubits.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"33 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146138509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-06DOI: 10.22331/q-2026-02-06-1996
Hochang Lee, Kyung Chul Jeong, Panjin Kim
This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to vertices and edges encode non-parallelizability. The reduction leads to algorithms for circuit optimization by adopting any vertex coloring solver as an optimization backend. The approach is validated by numerical experiments as well as applications to known quantum circuits, including finite field multiplication and QFT-based addition.
{"title":"Quantum Circuit Optimization by Graph Coloring","authors":"Hochang Lee, Kyung Chul Jeong, Panjin Kim","doi":"10.22331/q-2026-02-06-1996","DOIUrl":"https://doi.org/10.22331/q-2026-02-06-1996","url":null,"abstract":"This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to vertices and edges encode non-parallelizability. The reduction leads to algorithms for circuit optimization by adopting any vertex coloring solver as an optimization backend. The approach is validated by numerical experiments as well as applications to known quantum circuits, including finite field multiplication and QFT-based addition.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"17 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146121877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-06DOI: 10.22331/q-2026-02-06-1997
Gabrielle Tournaire, Marvin Schwiering, Robert Raussendorf, Sven Bachmann
We describe an efficient, fully fault-tolerant implementation of Measurement-Based Quantum Computation (MBQC) in the 3D cluster state. The two key novelties are (i) the introduction of a lattice defect in the underlying cluster state and (ii) the use of the Rudolph-Grover rebit encoding. Concretely, (i) allows for a topological implementation of the Hadamard gate, while (ii) does the same for the phase gate. Furthermore, we develop general ideas towards circuit compaction and algorithmic circuit verification, which we implement for the Reed-Muller code used for magic state distillation. Our performance analysis highlights the overall improvements provided by the new methods.
{"title":"A 3D lattice defect and efficient computations in topological MBQC","authors":"Gabrielle Tournaire, Marvin Schwiering, Robert Raussendorf, Sven Bachmann","doi":"10.22331/q-2026-02-06-1997","DOIUrl":"https://doi.org/10.22331/q-2026-02-06-1997","url":null,"abstract":"We describe an efficient, fully fault-tolerant implementation of Measurement-Based Quantum Computation (MBQC) in the 3D cluster state. The two key novelties are (i) the introduction of a lattice defect in the underlying cluster state and (ii) the use of the Rudolph-Grover rebit encoding. Concretely, (i) allows for a topological implementation of the Hadamard gate, while (ii) does the same for the phase gate. Furthermore, we develop general ideas towards circuit compaction and algorithmic circuit verification, which we implement for the Reed-Muller code used for magic state distillation. Our performance analysis highlights the overall improvements provided by the new methods.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"111 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146121878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-03DOI: 10.22331/q-2026-02-03-1994
Yize Sun, Zixin Wu, Volker Tresp, Yunpu Ma
Unsupervised representation learning presents new opportunities for advancing Quantum Architecture Search (QAS) on Noisy Intermediate-Scale Quantum (NISQ) devices. QAS is designed to optimize quantum circuits for Variational Quantum Algorithms (VQAs). Most QAS algorithms tightly couple the search space and search algorithm, typically requiring the evaluation of numerous quantum circuits, resulting in high computational costs and limiting scalability to larger quantum circuits. Predictor-based QAS algorithms mitigate this issue by estimating circuit performance based on structure or embedding. However, these methods often demand time-intensive labeling to optimize gate parameters across many circuits, which is crucial for training accurate predictors. Inspired by the classical neural architecture search algorithm $Arch2vec$, we investigate the potential of unsupervised representation learning for QAS without relying on predictors. Our framework decouples unsupervised architecture representation learning from the search process, enabling the learned representations to be applied across various downstream tasks. Additionally, it integrates an improved quantum circuit graph encoding scheme, addressing the limitations of existing representations and enhancing search efficiency. This predictor-free approach removes the need for large labeled datasets. During the search, we employ REINFORCE and Bayesian Optimization to explore the latent representation space and compare their performance against baseline methods. We further validate our approach by executing the best-discovered MaxCut circuits on IBM's ibm_sherbrooke quantum processor, confirming that the architectures retain optimal performance even under real hardware noise. Our results demonstrate that the framework efficiently identifies high-performing quantum circuits with fewer search iterations.
{"title":"Quantum Architecture Search with Unsupervised Representation Learning","authors":"Yize Sun, Zixin Wu, Volker Tresp, Yunpu Ma","doi":"10.22331/q-2026-02-03-1994","DOIUrl":"https://doi.org/10.22331/q-2026-02-03-1994","url":null,"abstract":"Unsupervised representation learning presents new opportunities for advancing Quantum Architecture Search (QAS) on Noisy Intermediate-Scale Quantum (NISQ) devices. QAS is designed to optimize quantum circuits for Variational Quantum Algorithms (VQAs). Most QAS algorithms tightly couple the search space and search algorithm, typically requiring the evaluation of numerous quantum circuits, resulting in high computational costs and limiting scalability to larger quantum circuits. Predictor-based QAS algorithms mitigate this issue by estimating circuit performance based on structure or embedding. However, these methods often demand time-intensive labeling to optimize gate parameters across many circuits, which is crucial for training accurate predictors. Inspired by the classical neural architecture search algorithm $Arch2vec$, we investigate the potential of unsupervised representation learning for QAS without relying on predictors. Our framework decouples unsupervised architecture representation learning from the search process, enabling the learned representations to be applied across various downstream tasks. Additionally, it integrates an improved quantum circuit graph encoding scheme, addressing the limitations of existing representations and enhancing search efficiency. This predictor-free approach removes the need for large labeled datasets. During the search, we employ REINFORCE and Bayesian Optimization to explore the latent representation space and compare their performance against baseline methods. We further validate our approach by executing the best-discovered MaxCut circuits on IBM's ibm_sherbrooke quantum processor, confirming that the architectures retain optimal performance even under real hardware noise. Our results demonstrate that the framework efficiently identifies high-performing quantum circuits with fewer search iterations.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"8 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146101980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-03DOI: 10.22331/q-2026-02-03-1995
Shuheng Liu, Qiongyi He, Marcus Huber, Giuseppe Vitagliano
Characterizing entanglement of systems composed of multiple particles is a very complex problem that is attracting increasing attention across different disciplines related to quantum physics. The task becomes even more complex when the particles have many accessible levels, i.e., they are of high dimension, which leads to a potentially high-dimensional multipartite entangled state. These are important resources for an ever-increasing number of tasks, especially when a network of parties needs to share highly entangled states, e.g., for communicating more efficiently and securely. For these applications, as well as for purely theoretical arguments, it is important to be able to certify both the high-dimensional and the genuine multipartite nature of entangled states, possibly based on simple measurements. Here we derive a novel method that achieves this and improves over typical entanglement witnesses like the fidelity with respect to states of a Greenberger-Horne-Zeilinger (GHZ) form, without needing more complex measurements. We test our condition on paradigmatic classes of high-dimensional multipartite entangled states like imperfect GHZ states with random noise, as well as on purely randomly chosen ones and find that, in comparison with other available criteria our method provides a significant advantage and is often also simpler to evaluate.
{"title":"Characterizing high-dimensional multipartite entanglement beyond Greenberger-Horne-Zeilinger fidelities","authors":"Shuheng Liu, Qiongyi He, Marcus Huber, Giuseppe Vitagliano","doi":"10.22331/q-2026-02-03-1995","DOIUrl":"https://doi.org/10.22331/q-2026-02-03-1995","url":null,"abstract":"Characterizing entanglement of systems composed of multiple particles is a very complex problem that is attracting increasing attention across different disciplines related to quantum physics. The task becomes even more complex when the particles have many accessible levels, i.e., they are of high dimension, which leads to a potentially high-dimensional multipartite entangled state. These are important resources for an ever-increasing number of tasks, especially when a network of parties needs to share highly entangled states, e.g., for communicating more efficiently and securely. For these applications, as well as for purely theoretical arguments, it is important to be able to certify both the high-dimensional and the genuine multipartite nature of entangled states, possibly based on simple measurements. Here we derive a novel method that achieves this and improves over typical entanglement witnesses like the fidelity with respect to states of a Greenberger-Horne-Zeilinger (GHZ) form, without needing more complex measurements. We test our condition on paradigmatic classes of high-dimensional multipartite entangled states like imperfect GHZ states with random noise, as well as on purely randomly chosen ones and find that, in comparison with other available criteria our method provides a significant advantage and is often also simpler to evaluate.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"1 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146101982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号