Pub Date : 2025-03-05DOI: 10.22331/q-2025-03-05-1652
Enrique Cervero-Martín, Marco Tomamichel
We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the original players. We propose a general device independent quantum key distribution protocol for the subset of such non-local games that satisfy a monogamy-of-entanglement property characterised by a gap in the maximum winning probability between the bipartite and tripartite versions of the game. This gap is due to the optimal strategy for two players requiring entanglement, which due to its monogamy property cannot be shared with any additional players. Based solely on the monogamy-of-entanglement property, we provide a simple proof of information theoretic security of our protocol. Lastly, we numerically optimize the finite and asymptotic secret key rates of our protocol using the magic square game as an example, for which we provide a numerical bound on the maximal tripartite quantum winning probability which closely matches the bipartite classical winning probability. Further, we show that our protocol is robust for depolarizing noise up to about $2.88%$, providing the first such bound for general attacks for magic square based quantum key distribution.
{"title":"Device independent security of quantum key distribution from monogamy-of-entanglement games","authors":"Enrique Cervero-Martín, Marco Tomamichel","doi":"10.22331/q-2025-03-05-1652","DOIUrl":"https://doi.org/10.22331/q-2025-03-05-1652","url":null,"abstract":"We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the original players. We propose a general device independent quantum key distribution protocol for the subset of such non-local games that satisfy a monogamy-of-entanglement property characterised by a gap in the maximum winning probability between the bipartite and tripartite versions of the game. This gap is due to the optimal strategy for two players requiring entanglement, which due to its monogamy property cannot be shared with any additional players. Based solely on the monogamy-of-entanglement property, we provide a simple proof of information theoretic security of our protocol. Lastly, we numerically optimize the finite and asymptotic secret key rates of our protocol using the magic square game as an example, for which we provide a numerical bound on the maximal tripartite quantum winning probability which closely matches the bipartite classical winning probability. Further, we show that our protocol is robust for depolarizing noise up to about $2.88%$, providing the first such bound for general attacks for magic square based quantum key distribution.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"50 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143560621","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 : 2025-02-26DOI: 10.22331/q-2025-02-26-1650
Mankei Tsang
The fascinating concept of coherent quantum absorber – which can absorb any photon emitted by another system while maintaining entanglement with that system – has found diverse implications in open quantum system theory and quantum metrology. This work generalizes the concept by proposing the so-called reversal conditions for the two systems, in which a "reverser" coherently reverses any effect of the other system on a field. The reversal conditions are rigorously boiled down to concise formulas involving the Petz recovery map and Kraus operators, thereby generalizing as well as streamlining the existing treatments of coherent absorbers.
{"title":"Quantum reversal: a general theory of coherent quantum absorbers","authors":"Mankei Tsang","doi":"10.22331/q-2025-02-26-1650","DOIUrl":"https://doi.org/10.22331/q-2025-02-26-1650","url":null,"abstract":"The fascinating concept of coherent quantum absorber – which can absorb any photon emitted by another system while maintaining entanglement with that system – has found diverse implications in open quantum system theory and quantum metrology. This work generalizes the concept by proposing the so-called reversal conditions for the two systems, in which a \"reverser\" coherently reverses any effect of the other system on a field. The reversal conditions are rigorously boiled down to concise formulas involving the Petz recovery map and Kraus operators, thereby generalizing as well as streamlining the existing treatments of coherent absorbers.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"28 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143507500","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}
Quantum non-Markovianity in tripartite quantum states $rho_{ABC}$ represents a correlation between systems $A$ and $C$ when conditioned on the system $B$ and is known to have both classical and quantum contributions. However, a systematic characterization of the latter is missing. To address this, we propose a faithful measure for non-Markovianity of genuine quantum origin called squashed quantum non-Markovianity (sQNM). It is based on the quantum conditional mutual information and is defined by the left-over non-Markovianity after squashing out all non-quantum contributions. It is lower bounded by the squashed entanglement between non-conditioning systems in the reduced state and is delimited by the extendibility of either of the non-conditioning systems. We show that the sQNM is monogamous, asymptotically continuous, convex, additive on tensor-product states, and generally super-additive. We characterize genuine quantum non-Markovianity as a resource via a convex resource theory after identifying free states with vanishing sQNM and free operations that do not increase sQNM in states. We use our resource-theoretic framework to bound the rate of state transformations under free operations and to study state transformation under non-free operations; in particular, we find the quantum communication cost from Bob ($B$) to Alice ($A$) or Charlie ($C$) is lower bounded by the change in sQNM in the states. The sQNM finds operational meaning; in particular, the optimal rate of private communication in a variant of conditional one-time pad protocol is twice the sQNM. Also, the minimum deconstruction cost for a variant of quantum deconstruction protocol is given twice the sQNM of the state.
{"title":"Squashed quantum non-Markovianity: a measure of genuine quantum non-Markovianity in states","authors":"Rajeev Gangwar, Tanmoy Pandit, Kaumudibikash Goswami, Siddhartha Das, Manabendra Nath Bera","doi":"10.22331/q-2025-02-26-1646","DOIUrl":"https://doi.org/10.22331/q-2025-02-26-1646","url":null,"abstract":"Quantum non-Markovianity in tripartite quantum states $rho_{ABC}$ represents a correlation between systems $A$ and $C$ when conditioned on the system $B$ and is known to have both classical and quantum contributions. However, a systematic characterization of the latter is missing. To address this, we propose a faithful measure for non-Markovianity of genuine quantum origin called squashed quantum non-Markovianity (sQNM). It is based on the quantum conditional mutual information and is defined by the left-over non-Markovianity after squashing out all non-quantum contributions. It is lower bounded by the squashed entanglement between non-conditioning systems in the reduced state and is delimited by the extendibility of either of the non-conditioning systems. We show that the sQNM is monogamous, asymptotically continuous, convex, additive on tensor-product states, and generally super-additive. We characterize genuine quantum non-Markovianity as a resource via a convex resource theory after identifying free states with vanishing sQNM and free operations that do not increase sQNM in states. We use our resource-theoretic framework to bound the rate of state transformations under free operations and to study state transformation under non-free operations; in particular, we find the quantum communication cost from Bob ($B$) to Alice ($A$) or Charlie ($C$) is lower bounded by the change in sQNM in the states. The sQNM finds operational meaning; in particular, the optimal rate of private communication in a variant of conditional one-time pad protocol is twice the sQNM. Also, the minimum deconstruction cost for a variant of quantum deconstruction protocol is given twice the sQNM of the state.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"83 1 Pt 2 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143495562","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 : 2025-02-26DOI: 10.22331/q-2025-02-26-1649
Andreas Klingler, Tim Netzer, Gemma De les Coves
The matrix rank and its positive versions are robust for small approximations, i.e. they do not decrease under small perturbations. In contrast, the multipartite tensor rank can collapse for arbitrarily small errors, i.e. there may be a gap between rank and border rank, leading to instabilities in the optimization over sets with fixed tensor rank. Can multipartite positive ranks also collapse for small perturbations? In this work, we prove that multipartite positive and invariant tensor decompositions exhibit gaps between rank and border rank, including tensor rank purifications and cyclic separable decompositions. We also prove a correspondence between positive decompositions and membership in certain sets of multipartite probability distributions, and leverage the gaps between rank and border rank to prove that these correlation sets are not closed. It follows that testing membership of probability distributions arising from resources like translational invariant Matrix Product States is impossible in finite time. Overall, this work sheds light on the instability of ranks and the unique behavior of bipartite systems.
{"title":"Border Ranks of Positive and Invariant Tensor Decompositions: Applications to Correlations","authors":"Andreas Klingler, Tim Netzer, Gemma De les Coves","doi":"10.22331/q-2025-02-26-1649","DOIUrl":"https://doi.org/10.22331/q-2025-02-26-1649","url":null,"abstract":"The matrix rank and its positive versions are robust for small approximations, i.e. they do not decrease under small perturbations. In contrast, the multipartite tensor rank can collapse for arbitrarily small errors, i.e. there may be a gap between rank and border rank, leading to instabilities in the optimization over sets with fixed tensor rank. Can multipartite positive ranks also collapse for small perturbations? In this work, we prove that multipartite positive and invariant tensor decompositions exhibit gaps between rank and border rank, including tensor rank purifications and cyclic separable decompositions. We also prove a correspondence between positive decompositions and membership in certain sets of multipartite probability distributions, and leverage the gaps between rank and border rank to prove that these correlation sets are not closed. It follows that testing membership of probability distributions arising from resources like translational invariant Matrix Product States is impossible in finite time. Overall, this work sheds light on the instability of ranks and the unique behavior of bipartite systems.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"1 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143506801","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 : 2025-02-26DOI: 10.22331/q-2025-02-26-1647
Amolak Ratan Kalra, Michele Mosca, Dinesh Valluri
In this paper we study single qutrit circuits consisting of words over the Clifford$+mathcal{D}$ cyclotomic gate set, where $mathcal{D}=text{diag}(pmxi^{a},pmxi^{b},pmxi^{c})$, $xi$ is a primitive $9$-th root of unity and $a,b,c$ are integers. We characterize classes of qutrit unit vectors $z$ with entries in $mathbb{Z}[xi, frac{1}{chi}]$ based on the possibility of reducing their smallest denominator exponent (sde) with respect to $chi := 1 – xi,$ by acting an appropriate gate in Clifford$+mathcal{D}$. We do this by studying the notion of `derivatives mod $3$' of an arbitrary element of $mathbb{Z}[xi]$ and using it to study the smallest denominator exponent of $Hmathcal{D}z$ where $H$ is the qutrit Hadamard gate and $mathcal{D}$. In addition, we reduce the problem of finding all unit vectors of a given sde to that of finding integral solutions of a positive definite quadratic form along with some additional constraints. As a consequence we prove that the Clifford$+mathcal{D}$ gates naturally arise as gates with sde $0$ and $3$ in the group $U(3,mathbb{Z}[xi, frac{1}{chi}])$ of $3 times 3$ unitaries with entries in $mathbb{Z}[xi, frac{1}{chi}]$. We illustrate the general applicability of these methods to obtain an exact synthesis algorithm for Clifford$+R$ and recover the previously known exact synthesis algorithm of Kliuchnikov, Maslov, Mosca (2012). The framework developed to formulate qutrit gate synthesis for Clifford$+mathcal{D}$ extends to qudits of arbitrary prime power.
{"title":"Synthesis and Arithmetic of Single Qutrit Circuits","authors":"Amolak Ratan Kalra, Michele Mosca, Dinesh Valluri","doi":"10.22331/q-2025-02-26-1647","DOIUrl":"https://doi.org/10.22331/q-2025-02-26-1647","url":null,"abstract":"In this paper we study single qutrit circuits consisting of words over the Clifford$+mathcal{D}$ cyclotomic gate set, where $mathcal{D}=text{diag}(pmxi^{a},pmxi^{b},pmxi^{c})$, $xi$ is a primitive $9$-th root of unity and $a,b,c$ are integers. We characterize classes of qutrit unit vectors $z$ with entries in $mathbb{Z}[xi, frac{1}{chi}]$ based on the possibility of reducing their smallest denominator exponent (sde) with respect to $chi := 1 – xi,$ by acting an appropriate gate in Clifford$+mathcal{D}$. We do this by studying the notion of `derivatives mod $3$' of an arbitrary element of $mathbb{Z}[xi]$ and using it to study the smallest denominator exponent of $Hmathcal{D}z$ where $H$ is the qutrit Hadamard gate and $mathcal{D}$. In addition, we reduce the problem of finding all unit vectors of a given sde to that of finding integral solutions of a positive definite quadratic form along with some additional constraints. As a consequence we prove that the Clifford$+mathcal{D}$ gates naturally arise as gates with sde $0$ and $3$ in the group $U(3,mathbb{Z}[xi, frac{1}{chi}])$ of $3 times 3$ unitaries with entries in $mathbb{Z}[xi, frac{1}{chi}]$. We illustrate the general applicability of these methods to obtain an exact synthesis algorithm for Clifford$+R$ and recover the previously known exact synthesis algorithm of Kliuchnikov, Maslov, Mosca (2012). The framework developed to formulate qutrit gate synthesis for Clifford$+mathcal{D}$ extends to qudits of arbitrary prime power.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"3 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143495566","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 : 2025-02-26DOI: 10.22331/q-2025-02-26-1651
Tara Kalsi, Alessandro Romito, Henning Schomerus
A key conjecture about the evolution of complex quantum systems towards an ergodic steady state, known as scrambling, is that this process acquires universal features when it is most efficient. We develop a single-parameter scaling theory for the spectral statistics in this scenario, which embodies exact self-similarity of the spectral correlations along the complete scrambling dynamics. We establish that the scaling predictions are matched by a privileged stochastic process and serve as bounds for other dynamical scrambling scenarios, allowing one to quantify inefficient or incomplete scrambling on all time scales.
{"title":"Spectral chaos bounds from scaling theory of maximally efficient quantum-dynamical scrambling","authors":"Tara Kalsi, Alessandro Romito, Henning Schomerus","doi":"10.22331/q-2025-02-26-1651","DOIUrl":"https://doi.org/10.22331/q-2025-02-26-1651","url":null,"abstract":"A key conjecture about the evolution of complex quantum systems towards an ergodic steady state, known as scrambling, is that this process acquires universal features when it is most efficient. We develop a single-parameter scaling theory for the spectral statistics in this scenario, which embodies exact self-similarity of the spectral correlations along the complete scrambling dynamics. We establish that the scaling predictions are matched by a privileged stochastic process and serve as bounds for other dynamical scrambling scenarios, allowing one to quantify inefficient or incomplete scrambling on all time scales.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"28 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143506802","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 : 2025-02-26DOI: 10.22331/q-2025-02-26-1648
Masahito Hayashi
We study Heisenberg scaling of quantum metrology in the viewpoint of population coding. Although Fisher information has been used for a figure of merit to characterize Heisenberg scaling in quantum metrology, several studies pointed out it does not work as a figure of merit because it does not reflect the global structure. As an alternative figure of merit, we propose the mutual information, which connects the number of distinguishable elements of the parameter space in the viewpoint of population coding. We show that several unitary models achieve Heisenberg scaling in this context.
{"title":"Heisenberg scaling based on population coding","authors":"Masahito Hayashi","doi":"10.22331/q-2025-02-26-1648","DOIUrl":"https://doi.org/10.22331/q-2025-02-26-1648","url":null,"abstract":"We study Heisenberg scaling of quantum metrology in the viewpoint of population coding. Although Fisher information has been used for a figure of merit to characterize Heisenberg scaling in quantum metrology, several studies pointed out it does not work as a figure of merit because it does not reflect the global structure. As an alternative figure of merit, we propose the mutual information, which connects the number of distinguishable elements of the parameter space in the viewpoint of population coding. We show that several unitary models achieve Heisenberg scaling in this context.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"10 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143495563","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 : 2025-02-25DOI: 10.22331/q-2025-02-25-1643
Máté Farkas, Nikolai Miklin, Armin Tavakoli
Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However, only a few cases are solved exactly for quantum random access codes. In this paper, we provide bounds for the fully general setting of n independent variables, each selected from a d-dimensional classical alphabet and encoded in a $D$-dimensional quantum system subject to an arbitrary quantum measurement. The bound recovers the exactly known special cases, and we demonstrate numerically that even though the bound is not tight overall, it can still yield a good approximation.
{"title":"Simple and general bounds on quantum random access codes","authors":"Máté Farkas, Nikolai Miklin, Armin Tavakoli","doi":"10.22331/q-2025-02-25-1643","DOIUrl":"https://doi.org/10.22331/q-2025-02-25-1643","url":null,"abstract":"Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However, only a few cases are solved exactly for quantum random access codes. In this paper, we provide bounds for the fully general setting of n independent variables, each selected from a d-dimensional classical alphabet and encoded in a $D$-dimensional quantum system subject to an arbitrary quantum measurement. The bound recovers the exactly known special cases, and we demonstrate numerically that even though the bound is not tight overall, it can still yield a good approximation.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"27 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143495559","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 : 2025-02-25DOI: 10.22331/q-2025-02-25-1644
Tommaso Guaita
Known mappings that encode fermionic modes into a bosonic qubit system are non-local transformations. In this paper we establish that this must necessarily be the case, if the locality graph is complex enough (for example for regular 2$d$ lattices). In particular we show that, in case of exact encodings, a fully local mapping is possible if and only if the locality graph is a tree. If instead we allow ourselves to also consider operators that only act fermionically on a subspace of the qubit Hilbert space, then we show that this subspace must be composed of long range entangled states, if the locality graph contains at least two overlapping cycles. This implies, for instance, that on 2$d$ lattices there exist states that are of low depth from the fermionic point of view, while in any encoding require a circuit of depth at least proportional to the system size to be prepared.
{"title":"On the locality of qubit encodings of local fermionic modes","authors":"Tommaso Guaita","doi":"10.22331/q-2025-02-25-1644","DOIUrl":"https://doi.org/10.22331/q-2025-02-25-1644","url":null,"abstract":"Known mappings that encode fermionic modes into a bosonic qubit system are non-local transformations. In this paper we establish that this must necessarily be the case, if the locality graph is complex enough (for example for regular 2$d$ lattices). In particular we show that, in case of exact encodings, a fully local mapping is possible if and only if the locality graph is a tree. If instead we allow ourselves to also consider operators that only act fermionically on a subspace of the qubit Hilbert space, then we show that this subspace must be composed of long range entangled states, if the locality graph contains at least two overlapping cycles. This implies, for instance, that on 2$d$ lattices there exist states that are of low depth from the fermionic point of view, while in any encoding require a circuit of depth at least proportional to the system size to be prepared.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"85 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143495560","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 : 2025-02-25DOI: 10.22331/q-2025-02-25-1642
Cica Gustiani, Tyson Jones, Simon C. Benjamin
We present the Virtual Quantum Device (VQD) platform, a system based on the QuEST quantum emulator. Through the use of VQDs, non-expert users can emulate specific quantum computers with detailed error models, bespoke gate sets and connectivities. The platform boasts an intuitive interface, powerful visualisation, and compatibility with high-performance computation for effective testing and optimisation of complex quantum algorithms or ideas across a range of quantum computing hardware. We create and explore five families of VQDs corresponding to trapped ions, nitrogen-vacancy-centres, neutral atom arrays, silicon quantum dot spins, and superconducting devices. Each is highly configurable through a set of tailored parameters. We showcase the key characteristics of each virtual device, providing practical examples of the tool's usefulness and highlighting each device's specific attributes. By offering user-friendly encapsulated descriptions of diverse quantum hardware, the VQD platform offers researchers the ability to rapidly explore algorithms and protocols in a realistic setting; meanwhile hardware experts can create their own VQDs to compare with their experiments.
{"title":"The Virtual Quantum Device (VQD): A tool for detailed emulation of quantum computers","authors":"Cica Gustiani, Tyson Jones, Simon C. Benjamin","doi":"10.22331/q-2025-02-25-1642","DOIUrl":"https://doi.org/10.22331/q-2025-02-25-1642","url":null,"abstract":"We present the Virtual Quantum Device (VQD) platform, a system based on the QuEST quantum emulator. Through the use of VQDs, non-expert users can emulate specific quantum computers with detailed error models, bespoke gate sets and connectivities. The platform boasts an intuitive interface, powerful visualisation, and compatibility with high-performance computation for effective testing and optimisation of complex quantum algorithms or ideas across a range of quantum computing hardware. We create and explore five families of VQDs corresponding to trapped ions, nitrogen-vacancy-centres, neutral atom arrays, silicon quantum dot spins, and superconducting devices. Each is highly configurable through a set of tailored parameters. We showcase the key characteristics of each virtual device, providing practical examples of the tool's usefulness and highlighting each device's specific attributes. By offering user-friendly encapsulated descriptions of diverse quantum hardware, the VQD platform offers researchers the ability to rapidly explore algorithms and protocols in a realistic setting; meanwhile hardware experts can create their own VQDs to compare with their experiments.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"24 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143495558","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：