QuantumPub Date : 2025-05-05DOI: 10.22331/q-2025-05-05-1728
Christopher A. Pattison, Anirudh Krishna, John Preskill
{"title":"Hierarchical memories: Simulating quantum LDPC codes with local gates","authors":"Christopher A. Pattison, Anirudh Krishna, John Preskill","doi":"10.22331/q-2025-05-05-1728","DOIUrl":"https://doi.org/10.22331/q-2025-05-05-1728","url":null,"abstract":"Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to geometric-locality constraints, it becomes challenging to realize these codes. In this paper, we construct a new family of $[[N,K,D]]$ codes, referred to as hierarchical codes, that encode a number of logical qubits $K = Omega(N/log(N)^2)$. The $N^{th}$ element of this code family is obtained by concatenating a constant-rate quantum LDPC code with a surface code; nearest-neighbor gates in two dimensions are sufficient to implement the corresponding syndrome-extraction circuit and achieve a threshold. Below threshold the logical failure rate vanishes superpolynomially as a function of the distance $D(N)$. We present a bilayer architecture for implementing the syndrome-extraction circuit, and estimate the logical failure rate for this architecture. Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"35 1","pages":"1728"},"PeriodicalIF":6.4,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143910409","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}
QuantumPub Date : 2025-05-05DOI: 10.22331/q-2025-05-05-1726
Tom O'Leary, Lewis W. Anderson, Dieter Jaksch, Martin Kiffner
{"title":"Partitioned Quantum Subspace Expansion","authors":"Tom O'Leary, Lewis W. Anderson, Dieter Jaksch, Martin Kiffner","doi":"10.22331/q-2025-05-05-1726","DOIUrl":"https://doi.org/10.22331/q-2025-05-05-1726","url":null,"abstract":"We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We propose a variance-based criterion for determining a good iterative sequence and provide numerical evidence that these good sequences display improved numerical stability over a single step in the presence of finite sampling noise. Implementing the generalisation requires additional classical processing with a polynomial overhead in the subspace dimension. By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware. Our work suggests that the numerical instability limiting the accuracy of this approach can be substantially alleviated in a parameter-free way.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"7 1","pages":"1726"},"PeriodicalIF":6.4,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143910406","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}
QuantumPub Date : 2025-05-05DOI: 10.22331/q-2025-05-05-1730
Guillermo González-García, J. Ignacio Cirac, Rahul Trivedi
{"title":"Pauli path simulations of noisy quantum circuits beyond average case","authors":"Guillermo González-García, J. Ignacio Cirac, Rahul Trivedi","doi":"10.22331/q-2025-05-05-1730","DOIUrl":"https://doi.org/10.22331/q-2025-05-05-1730","url":null,"abstract":"For random quantum circuits on $n$ qubits of depth $Theta(log n)$ with depolarizing noise, the task of sampling from the output state can be efficiently performed classically using a Pauli path method [1] . This paper aims to study the performance of this method beyond random circuits. We first consider the classical simulation of local observables in circuits composed of Clifford and T gates $unicode{x2013}$ going beyond the average case analysis, we derive sufficient conditions for simulatability in terms of the noise rate and the fraction of gates that are T gates, and show that if noise is introduced at a faster rate than T gates, the simulation becomes classically easy. As an application of this result, we study 2D QAOA circuits that attempt to find low-energy states of classical Ising models on general graphs. There, our results shows that for hard instances of the problem, which correspond to Ising model's graph being geometrically non-local, a QAOA algorithm mapped to a geometrically local circuit architecture using SWAP gates does not have any asymptotic advantage over classical algorithms if depolarized at a constant rate. Finally, we illustrate instances where the Pauli path method fails to give the correct result, and also initiate a study of the trade-off between fragility to noise and classical complexity of simulating a given quantum circuit.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"24 1","pages":"1730"},"PeriodicalIF":6.4,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143910415","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}
QuantumPub Date : 2025-05-05DOI: 10.22331/q-2025-05-05-1724
Hongye Yu, Tzu-Chieh Wei
{"title":"Efficient separate quantification of state preparation errors and measurement errors on quantum computers and their mitigation","authors":"Hongye Yu, Tzu-Chieh Wei","doi":"10.22331/q-2025-05-05-1724","DOIUrl":"https://doi.org/10.22331/q-2025-05-05-1724","url":null,"abstract":"Current noisy quantum computers have multiple types of errors, which can occur in the state preparation, measurement/readout, and gate operation, as well as intrinsic decoherence and relaxation. Partly motivated by the booming of intermediate-scale quantum processors, measurement and gate errors have been recently extensively studied, and several methods of mitigating them have been proposed and formulated in software packages (e.g., in IBM Qiskit). Despite this, the state preparation error and the procedure to quantify it have not yet been standardized, as state preparation and measurement errors are usually considered not directly separable. Inspired by a recent work of Laflamme, Lin, and Mor [15], we propose a simple and resource-efficient approach to quantify separately the state preparation and readout error rates. With these two errors separately quantified, we also propose methods to mitigate them separately, especially mitigating state preparation errors with linear (with the number of qubits) complexity. As a result of the separate mitigation, we show that the fidelity of the outcome can be improved by an order of magnitude compared to the standard measurement error mitigation scheme. We also show that the quantification and mitigation scheme is resilient against gate noise and can be immediately applied to current noisy quantum computers. To demonstrate this, we present results from cloud experiments on IBM's superconducting quantum computers. The results indicate that the state preparation error rate is also an important metric for qubit metrology that can be efficiently obtained.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"69 1","pages":"1724"},"PeriodicalIF":6.4,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143910403","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}
QuantumPub Date : 2025-05-05DOI: 10.22331/q-2025-05-05-1727
Piotr Czarnik, Michael McKerns, Andrew T. Sornborger, Lukasz Cincio
{"title":"Improving the efficiency of learning-based error mitigation","authors":"Piotr Czarnik, Michael McKerns, Andrew T. Sornborger, Lukasz Cincio","doi":"10.22331/q-2025-05-05-1727","DOIUrl":"https://doi.org/10.22331/q-2025-05-05-1727","url":null,"abstract":"Error mitigation will play an important role in practical applications of near-term noisy quantum computers. Current error mitigation methods typically concentrate on correction quality at the expense of frugality (as measured by the number of additional calls to quantum hardware). To fill the need for highly accurate, yet inexpensive techniques, we introduce an error mitigation scheme that builds on Clifford data regression (CDR). The scheme improves the frugality by carefully choosing the training data and exploiting the symmetries of the problem. We test our approach by correcting long range correlators of the ground state of XY Hamiltonian on IBM Toronto quantum computer. We find that our method is an order of magnitude cheaper while maintaining the same accuracy as the original CDR approach. The efficiency gain enables us to obtain a factor of $10$ improvement on the unmitigated results with the total budget as small as $2cdot10^5$ shots. Furthermore, we demonstrate orders of magnitude improvements in frugality for mitigation of energy of the LiH ground state simulated with IBM's Ourense-derived noise model.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"8 1","pages":"1727"},"PeriodicalIF":6.4,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143910405","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}
QuantumPub Date : 2025-05-05DOI: 10.22331/q-2025-05-05-1731
Mykolas Sveistrys, Josias Langbehn, Raphaël Menu, Steve Campbell, Giovanna Morigi, Christiane P. Koch
{"title":"Speeding up Quantum Annealing with Engineered Dephasing","authors":"Mykolas Sveistrys, Josias Langbehn, Raphaël Menu, Steve Campbell, Giovanna Morigi, Christiane P. Koch","doi":"10.22331/q-2025-05-05-1731","DOIUrl":"https://doi.org/10.22331/q-2025-05-05-1731","url":null,"abstract":"Building on the insight that engineered noise, specifically, engineered dephasing can enhance the adiabaticity of controlled quantum dynamics, we investigate how a dephasing-generating coupling to an auxiliary quantum system affects quantum annealing protocols. By calculating the exact reduced system dynamics, we show how this coupling enhances the system's adiabaticity solely through a coherent mechanism – an effective energy rescaling. We show that it can lead to an annealing speedup linearly proportional to the strength of the coupling. We discuss the experimental feasibility of the protocols, and investigate the trade-off between fidelity and implementability by examining two modified versions with fewer types of required physical couplings.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"11 1","pages":"1731"},"PeriodicalIF":6.4,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143910410","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}
QuantumPub Date : 2025-05-05DOI: 10.22331/q-2025-05-05-1732
Tim Weaving, Alexis Ralli, Peter J. Love, Sauro Succi, Peter V. Coveney
{"title":"Accurately Simulating the Time Evolution of an Ising Model with Echo Verified Clifford Data Regression on a Superconducting Quantum Computer","authors":"Tim Weaving, Alexis Ralli, Peter J. Love, Sauro Succi, Peter V. Coveney","doi":"10.22331/q-2025-05-05-1732","DOIUrl":"https://doi.org/10.22331/q-2025-05-05-1732","url":null,"abstract":"We present an error mitigation strategy composed of Echo Verification (EV) and Clifford Data Regression (CDR), the combination of which allows one to learn the effect of the quantum noise channel to extract error mitigated estimates for the expectation value of Pauli observables. We analyse the behaviour of the method under the depolarizing channel and derive an estimator for the depolarization rate in terms of the ancilla purity and postselection probability. We also highlight the sensitivity of this probability to noise, a potential bottleneck for the technique. We subsequently consider a more general noise channel consisting of arbitrary Pauli errors, which reveals a linear relationship between the error rates and the estimation of expectation values, suggesting the learnability of noise in EV by regression techniques. Finally, we present a practical demonstration of Echo Verified Clifford Data Regression (EVCDR) on a superconducting quantum computer and observe accurate results for the time evolution of an Ising model over spin-lattices consisting of up to 35 sites and circuit depths up to 173 entangling layers.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"115 1","pages":"1732"},"PeriodicalIF":6.4,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143910411","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}
QuantumPub Date : 2025-04-24DOI: 10.22331/q-2025-04-24-1721
Vittorio D'Esposito, Giuseppe Fabiano, Domenico Frattulillo, Flavio Mercati
{"title":"Doubly Quantum Mechanics","authors":"Vittorio D'Esposito, Giuseppe Fabiano, Domenico Frattulillo, Flavio Mercati","doi":"10.22331/q-2025-04-24-1721","DOIUrl":"https://doi.org/10.22331/q-2025-04-24-1721","url":null,"abstract":"Motivated by the expectation that relativistic symmetries might acquire quantum features in Quantum Gravity, we take the first steps towards a theory of ''Doubly'' Quantum Mechanics, a modification of Quantum Mechanics in which the geometrical configurations of physical systems, measurement apparata, and reference frame transformations are themselves quantized and described by ''geometry'' states in a Hilbert space. We develop the formalism for spin-$frac{1}{2}$ measurements by promoting the group of spatial rotations $SU(2)$ to the quantum group $SU_q(2)$ and generalizing the axioms of Quantum Theory in a covariant way. As a consequence of our axioms, the notion of probability becomes a self-adjoint operator acting on the Hilbert space of geometry states, hence acquiring novel non-classical features. After introducing a suitable class of semi-classical geometry states, which describe near-to-classical geometrical configurations of physical systems, we find that probability measurements are affected, in these configurations, by intrinsic uncertainties stemming from the quantum properties of $SU_q(2)$. This feature translates into an unavoidable fuzziness for observers attempting to align their reference frames by exchanging qubits, even when the number of exchanged qubits approaches infinity, contrary to the standard $SU(2)$ case.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"1 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143872896","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}
QuantumPub Date : 2025-04-24DOI: 10.22331/q-2025-04-24-1720
Adam Burchardt, Frederik Hahn
{"title":"The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States","authors":"Adam Burchardt, Frederik Hahn","doi":"10.22331/q-2025-04-24-1720","DOIUrl":"https://doi.org/10.22331/q-2025-04-24-1720","url":null,"abstract":"This paper introduces the foliage partition, an easy-to-compute LC-invariant for graph states, of computational complexity $mathcal{O}(n^3)$ in the number of qubits. Inspired by the foliage of a graph, our invariant has a natural graphical representation in terms of leaves, axils, and twins. It captures both, the connection structure of a graph and the $2$-body marginal properties of the associated graph state. We relate the foliage partition to the size of LC-orbits and use it to bound the number of LC-automorphisms of graphs. We also show the invariance of the foliage partition when generalized to weighted graphs and qudit graph states.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"2 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143867014","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}
QuantumPub Date : 2025-04-24DOI: 10.22331/q-2025-04-24-1722
Ziang Wang, Feng Wu, Hui-Hai Zhao, Xin Wan, Xiaotong Ni
{"title":"SuperGrad: a differentiable simulator for superconducting processors","authors":"Ziang Wang, Feng Wu, Hui-Hai Zhao, Xin Wan, Xiaotong Ni","doi":"10.22331/q-2025-04-24-1722","DOIUrl":"https://doi.org/10.22331/q-2025-04-24-1722","url":null,"abstract":"One significant advantage of superconducting processors is their extensive design flexibility, which encompasses various types of qubits and interactions. Given the large number of tunable parameters of a processor, the ability to perform gradient optimization would be highly beneficial. Efficient backpropagation for gradient computation requires a tightly integrated software library, for which no open-source implementation is currently available. In this work, we introduce SuperGrad, a simulator that accelerates the design of superconducting quantum processors by incorporating gradient computation capabilities. SuperGrad offers a user-friendly interface for constructing Hamiltonians and computing both static and dynamic properties of composite systems. This differentiable simulation is valuable for a range of applications, including optimal control, design optimization, and experimental data fitting. In this paper, we demonstrate these applications through examples and code snippets.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"2 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143872898","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}