01817nas a2200181 4500008004100000245006100041210006100102260001400163520125300177100003201430700001901462700002201481700002201503700002001525700002801545700002501573856003701598 2024 eng d00aEstimation of Hamiltonian parameters from thermal states0 aEstimation of Hamiltonian parameters from thermal states c1/18/20243 a

We upper- and lower-bound the optimal precision with which one can estimate an unknown Hamiltonian parameter via measurements of Gibbs thermal states with a known temperature. The bounds depend on the uncertainty in the Hamiltonian term that contains the parameter and on the term's degree of noncommutativity with the full Hamiltonian: higher uncertainty and commuting operators lead to better precision. We apply the bounds to show that there exist entangled thermal states such that the parameter can be estimated with an error that decreases faster than 1/n−−√, beating the standard quantum limit. This result governs Hamiltonians where an unknown scalar parameter (e.g. a component of a magnetic field) is coupled locally and identically to n qubit sensors. In the high-temperature regime, our bounds allow for pinpointing the optimal estimation error, up to a constant prefactor. Our bounds generalize to joint estimations of multiple parameters. In this setting, we recover the high-temperature sample scaling derived previously via techniques based on quantum state discrimination and coding theory. In an application, we show that noncommuting conserved quantities hinder the estimation of chemical potentials.

1 aGarcía-Pintos, Luis, Pedro1 aBharti, Kishor1 aBringewatt, Jacob1 aDehghani, Hossein1 aEhrenberg, Adam1 aHalpern, Nicole, Yunger1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2401.1034302121nas a2200181 4500008004100000245006900041210006800110260001400178520156100192100001901753700002201772700001901794700001901813700002401832700002501856700002101881856003701902 2023 eng d00aFault-tolerant hyperbolic Floquet quantum error correcting codes0 aFaulttolerant hyperbolic Floquet quantum error correcting codes c9/18/20233 a

A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes." These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for n qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate (1/8+2/n) and have a depth-3 syndrome extraction circuit. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in n. The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a [[400,52,8]] code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.

1 aFahimniya, Ali1 aDehghani, Hossein1 aBharti, Kishor1 aMathew, Sheryl1 aKollár, Alicia, J.1 aGorshkov, Alexey, V.1 aGullans, Michael uhttps://arxiv.org/abs/2309.1003301438nas a2200133 4500008004100000245003700041210003700078260001400115520106600129100002401195700002901219700001901248856003701267 2022 eng d00aCertifying Temporal Correlations0 aCertifying Temporal Correlations c6/13/20223 a

Self-testing has been established as a major approach for quantum device certification based on experimental statistics under minimal assumptions. However, despite more than 20 years of research effort most of the self-testing protocols are restricted to spatial scenarios (Bell scenarios), without any temporal generalisations known. Under the scenario of sequential measurements performed on a single quantum system, we build upon previous works which used semi-definite programming (SDP) based methods to bound sequential measurement inequalities. For such SDPs, we show that the optimiser matrix is unique and moreover this uniqueness is robust to small deviations from the quantum bound. Further, we consider a generalised scenario in presence of quantum channels and draw analogies in the structure of Bell and sequential inequalities using the pseudo-density matrix formalism. These analogies allow us to show a practical use of maximal violations of sequential inequalities in the form of certification of quantum channels up to isometries. 

1 aShrotriya, Harshank1 aKwek, Kishor, Bharti Leo1 aBharti, Kishor uhttps://arxiv.org/abs/2206.0609201066nas a2200145 4500008004100000245006700041210006700108260001400175520061300189100002100802700001900823700002200842700001900864856003700883 2022 eng d00aNISQ algorithm for the matrix elements of a generic observable0 aNISQ algorithm for the matrix elements of a generic observable c5/20/20223 a

The calculation of off-diagonal matrix elements has various applications in fields such as nuclear physics and quantum chemistry. In this paper, we present a noisy intermediate scale quantum algorithm for estimating the diagonal and off-diagonal matrix elements of a generic observable in the energy eigenbasis of a given Hamiltonian. Several numerical simulations indicate that this approach can find many of the matrix elements even when the trial functions are randomly initialized across a wide range of parameter values without, at the same time, the need to prepare the energy eigenstates. 

1 aErbanni, Rebecca1 aBharti, Kishor1 aKwek, Leong-Chuan1 aPoletti, Dario uhttps://arxiv.org/abs/2205.10058