Quantum最新文献

{"title":"Efficient Quantum Cooling Algorithm for Fermionic Systems","authors":"Lucas Marti, Refik Mansuroglu, Michael J. Hartmann","doi":"10.22331/q-2025-02-18-1635","DOIUrl":"https://doi.org/10.22331/q-2025-02-18-1635","url":null,"abstract":"We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known ground state. We derive suitable interaction Hamiltonians that originate from ladder operators of the free theory and initiate resonant gaps between system and fridge. We further propose a spectroscopic scan to find the relevant eigenenergies of the system using energy measurements on the fridge. With these insights, we design a ground state cooling algorithm for fermionic systems that is efficient, i.e. its runtime is polynomial in the system size, as long as the initial state is prepared in a low-energy sector of polynomial size. We achieve the latter via a pseudo-adiabatic sweep from a parameter regime whose ground state can be easily prepared. We estimate that our algorithm has a polynomial runtime for systems where the spectral gap decreases at most polynomially in system size, and is faster than the adiabatic algorithm for a large range of settings. We generalize the algorithm to prepare thermal states and demonstrate our findings on the Fermi-Hubbard model.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"13 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143443275","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}

{"title":"Tight Bounds on the Spooky Pebble Game: Recycling Qubits with Measurements","authors":"Niels Kornerup, Jonathan Sadun, David Soloveichik","doi":"10.22331/q-2025-02-18-1636","DOIUrl":"https://doi.org/10.22331/q-2025-02-18-1636","url":null,"abstract":"Pebble games are popular models for analyzing time-space trade-offs. In particular, reversible pebble game strategies are frequently applied in quantum algorithms like Grover's search to efficiently simulate classical computation on inputs in superposition, as unitary operations are fundamentally reversible. However, the reversible pebble game cannot harness the additional computational power granted by intermediate measurements, which are irreversible. The spooky pebble game, which models interleaved Hadamard basis measurements and adaptive phase corrections, reduces the number of qubits beyond what purely reversible approaches can achieve. While the spooky pebble game does not reduce the total space (bits plus qubits) complexity of the simulation, it reduces the amount of space that must be stored in qubits. We prove asymptotically tight trade-offs for the spooky pebble game on a line with any pebble bound. This in turn gives a tight time-qubit tradeoff for simulating arbitrary classical sequential computation when using the spooky pebble game. For example, for all $epsilon in (0,1]$, any classical computation requiring time $T$ and space $S$ can be implemented on a quantum computer using only $O(T/ epsilon)$ gates and $O(T^{epsilon}S^{1-epsilon})$ qubits. This improves on the best known bound for the reversible pebble game with that number of qubits, which uses $O(2^{1/epsilon} T)$ gates. For smaller space bounds, we show that the spooky pebble game can simulate arbitrary computation with $O(T^{1+epsilon} S^{-epsilon}/epsilon)$ gates and $O(S / epsilon)$ qubits whereas any simulation via the reversible pebble game requires $Omega(S cdot (1+log(T/S)))$ qubits.<br/>\u0000<br/> We also consider the spooky pebble game on more general directed acyclic graphs (DAGs), capturing fine-grained data dependency in computation. We show that for an arbitrary DAG even approximating the number of required pebbles in the spooky pebble game is PSPACE-hard. Despite this, we are able to construct a time-efficient strategy for pebbling binary trees that uses the minimum number of pebbles.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"11 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143443277","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}

{"title":"Cutting circuits with multiple two-qubit unitaries","authors":"Lukas Schmitt, Christophe Piveteau, David Sutter","doi":"10.22331/q-2025-02-18-1634","DOIUrl":"https://doi.org/10.22331/q-2025-02-18-1634","url":null,"abstract":"Quasiprobabilistic cutting techniques allow us to partition large quantum circuits into smaller subcircuits by replacing non-local gates with probabilistic mixtures of local gates. The cost of this method is a sampling overhead that scales exponentially in the number of cuts. It is crucial to determine the minimal cost for gate cutting and to understand whether allowing for classical communication between subcircuits can improve the sampling overhead. In this work, we derive a closed formula for the optimal sampling overhead for cutting an arbitrary number of two-qubit unitaries and provide the corresponding decomposition. We find that cutting several arbitrary two-qubit unitaries together is cheaper than cutting them individually and classical communication does not give any advantage.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"19 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143435707","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}

{"title":"Light-matter correlations in Quantum Floquet engineering of cavity quantum materials","authors":"Beatriz Pérez-González, Gloria Platero, Álvaro Gomez-León","doi":"10.22331/q-2025-02-17-1633","DOIUrl":"https://doi.org/10.22331/q-2025-02-17-1633","url":null,"abstract":"Quantum Floquet engineering (QFE) seeks to generalize the control of quantum systems with classical external fields, widely known as Semi-Classical Floquet engineering (SCFE), to quantum fields. However, to faithfully capture the physics at arbitrary coupling, a gauge-invariant description of light-matter interaction in cavity-QED materials is required, which makes the Hamiltonian highly non-linear in photonic operators. We provide a non-perturbative truncation scheme of the Hamiltonian, which is valid or arbitrary coupling strength, and use it to investigate the role of light-matter correlations, which are absent in SCFE. We find that even in the high-frequency regime, light-matter correlations can be crucial, in particular for the topological properties of a system. As an example, we show that for a SSH chain coupled to a cavity, light-matter correlations break the original chiral symmetry of the chain, strongly affecting the robustness of its edge states. In addition, we show how light-matter correlations are imprinted in the photonic spectral function and discuss their relation with the topology of the bands.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"80 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143427410","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}

{"title":"Minimising surface-code failures using a color-code decoder","authors":"Asmae Benhemou, Kaavya Sahay, Lingling Lao, Benjamin J. Brown","doi":"10.22331/q-2025-02-17-1632","DOIUrl":"https://doi.org/10.22331/q-2025-02-17-1632","url":null,"abstract":"The development of practical, high-performance decoding algorithms reduces the resource cost of fault-tolerant quantum computing. Here we propose a decoder for the surface code that finds low-weight correction operators for errors produced by the depolarising noise model. The decoder is obtained by mapping the syndrome of the surface code onto that of the color code, thereby allowing us to adopt more sophisticated color-code decoding algorithms. Analytical arguments and exhaustive testing show that the resulting decoder can find a least-weight correction for all weight $d/2$ depolarising errors for even code distance $d$. This improves the logical error rate by an exponential factor $O(2^{d/2})$ compared with decoders that treat bit-flip and dephasing errors separately. We demonstrate this improvement with analytical arguments and supporting numerical simulations at low error rates. Of independent interest, we also demonstrate an exponential improvement in logical error rate for our decoder used to correct independent and identically distributed bit-flip errors affecting the color code compared with more conventional color-code decoding algorithms.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"49 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143427409","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}

{"title":"Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems","authors":"Qiang Miao, Thomas Barthel","doi":"10.22331/q-2025-02-11-1631","DOIUrl":"https://doi.org/10.22331/q-2025-02-11-1631","url":null,"abstract":"Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"2018 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143393013","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}

{"title":"Refining resource estimation for the quantum computation of vibrational molecular spectra through Trotter error analysis","authors":"Dimitar Trenev, Pauline J Ollitrault, Stuart M. Harwood, Tanvi P. Gujarati, Sumathy Raman, Antonio Mezzacapo, Sarah Mostame","doi":"10.22331/q-2025-02-11-1630","DOIUrl":"https://doi.org/10.22331/q-2025-02-11-1630","url":null,"abstract":"Accurate simulations of vibrational molecular spectra are expensive on conventional computers. Compared to the electronic structure problem, the vibrational structure problem with quantum computers is less investigated. In this work we accurately estimate quantum resources, such as number of logical qubits and quantum gates, required for vibrational structure calculations on a programmable quantum computer. Our approach is based on quantum phase estimation and focuses on fault-tolerant quantum devices. In addition to asymptotic estimates for generic chemical compounds, we present a more detailed analysis of the quantum resources needed for the simulation of the Hamiltonian arising in the vibrational structure calculation of acetylene-like polyynes of interest. Leveraging nested commutators, we provide an in-depth quantitative analysis of trotter errors compared to the prior investigations. Ultimately, this work serves as a guide for analyzing the potential quantum advantage within vibrational structure simulations.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"63 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143393012","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}

{"title":"A de Finetti theorem for quantum causal structures","authors":"Fabio Costa, Jonathan Barrett, Sally Shrapnel","doi":"10.22331/q-2025-02-11-1628","DOIUrl":"https://doi.org/10.22331/q-2025-02-11-1628","url":null,"abstract":"What does it mean for a causal structure to be `unknown'? Can we even talk about `repetitions' of an experiment without prior knowledge of causal relations? And under what conditions can we say that a set of processes with arbitrary, possibly indefinite, causal structure are independent and identically distributed? Similar questions for classical probabilities, quantum states, and quantum channels are beautifully answered by so-called \"de Finetti theorems\", which connect a simple and easy-to-justify condition – symmetry under exchange – with a very particular multipartite structure: a mixture of identical states/channels. Here we extend the result to processes with arbitrary causal structure, including indefinite causal order and multi-time, non-Markovian processes applicable to noisy quantum devices. The result also implies a new class of de Finetti theorems for quantum states subject to a large class of linear constraints, which can be of independent interest.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"41 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143393010","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}

{"title":"Superpositions of thermalisations in relativistic quantum field theory","authors":"Joshua Foo, Magdalena Zych","doi":"10.22331/q-2025-02-11-1629","DOIUrl":"https://doi.org/10.22331/q-2025-02-11-1629","url":null,"abstract":"Recent results in relativistic quantum information and quantum thermodynamics have independently shown that in the quantum regime, a system may fail to thermalise when subject to quantum-controlled application of the same, single thermalisation channel. For example, an accelerating system with fixed proper acceleration is known to thermalise to an acceleration-dependent temperature, known as the Unruh temperature. However, the same system in a superposition of spatially translated trajectories that share the same proper acceleration fails to thermalise. Here, we provide an explanation of these results using the framework of quantum field theory in relativistic noninertial reference frames. We show how a probe that accelerates in a superposition of spatial translations interacts with incommensurate sets of field modes. In special cases where the modes are orthogonal (for example, when the Rindler wedges are translated in a direction orthogonal to the plane of motion), thermalisation does indeed result, corroborating the here provided explanation. We then discuss how this description relates to an information-theoretic approach aimed at studying quantum aspects of temperature through quantum-controlled thermalisations. The present work draws a connection between research in quantum information, relativistic physics, and quantum thermodynamics, in particular showing that relativistic quantum effects can provide a natural realisation of quantum thermodynamical scenarios.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"16 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143393018","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}

{"title":"Quantum complexity phase transitions in monitored random circuits","authors":"Ryotaro Suzuki, Jonas Haferkamp, Jens Eisert, Philippe Faist","doi":"10.22331/q-2025-02-10-1627","DOIUrl":"https://doi.org/10.22331/q-2025-02-10-1627","url":null,"abstract":"Recently, the dynamics of quantum systems that involve both unitary evolution and quantum measurements have attracted attention due to the exotic phenomenon of measurement-induced phase transitions. The latter refers to a sudden change in a property of a state of $n$ qubits, such as its entanglement entropy, depending on the rate at which individual qubits are measured. At the same time, quantum complexity emerged as a key quantity for the identification of complex behaviour in quantum many-body dynamics. In this work, we investigate the dynamics of the quantum state complexity in monitored random circuits, where $n$ qubits evolve according to a random unitary circuit and are individually measured with a fixed probability at each time step. We find that the evolution of the exact quantum state complexity undergoes a phase transition when changing the measurement rate. Below a critical measurement rate, the complexity grows at least linearly in time until saturating to a value $e^{Omega(n)}$. Above, the complexity does not exceed $operatorname{poly}(n)$. In our proof, we make use of percolation theory to find paths along which an exponentially long quantum computation can be run below the critical rate, and to identify events where the state complexity is reset to zero above the critical rate. We lower bound the exact state complexity in the former regime using recently developed techniques from algebraic geometry. Our results combine quantum complexity growth, phase transitions, and computation with measurements to help understand the behavior of monitored random circuits and to make progress towards determining the computational power of measurements in many-body systems.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"23 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143375502","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}