arXiv subjects

Akimasa Miyake

Publications and source records attributed to Akimasa Miyake.

At least 19 recordsLinked to original sources

arXiv2026

Correlation is magic in electronic structure Hamiltonians

The gate and qubit requirements of quantum computations of electronic structure have been extensively studied. However, the quantum resources present in electronic ground states, as measured by entanglement and magic, remain less well understood. We study the relationship between correlation in electronic structure Hamiltonians and magic as measured by the 2-stabilizer Renyi entropy (2-SRE). Perturbative calculations show that the 2-SRE of a given state is proportional to its overlap with a reference stabilizer state. In the context of quantum chemistry, this links the magic of electronic structure ground states to their Hartree-Fock weight, an established measure of electronic correlation. We then show that the 2-SRE of post-Hartree-Fock ground states is proportional to the correlation energy they recover. We explore this connection through the contextual subspace (CS) method. We present a theoretical framework showing that the CS method can be used to monotonically vary the magic of approximate CS ground states, and we prove that the correlation energy recovered by the CS ground states is proportional to the magic present in the approximate ground state. We present simulation results using 190 molecular species under Jordan-Wigner encoding at a range of bond lengths. The linear relationships between magic and correlation are robust across the Hamiltonians in our dataset, but break down at bond lengths beyond the Coulson-Fischer point, where Hartree-Fock fails to capture key physical features of the true ground state wavefunction. By establishing linear relationships for both correlation energy and Hartree-Fock reference weight with the 2-SRE, we conclude that for weakly- and moderately-correlated electronic structure Hamiltonians, the correlation is directly represented by 2-SRE, and thus by the magic.

quant-ph↗

arXiv2026

Adaptive quantum metrology with large dynamic range using short one-axis twists

Phase estimation with potentially large phase values, i.e., with large dynamic range, has many applications in quantum metrology, for example to atomic clocks. A recently proposed phase estimation scheme approaches the Heisenberg scaling in this global setting using sequences of increasingly squeezed Gaussian states as probes and adaptively chosen, potentially mid-circuit, measurements. In this work, we first observe that the pattern of increase in the squeezing of the probes is applicable even to states with some non-Gaussian features. We then propose an experimentally feasible version of this phase estimation scheme, based on the alternating application of one-axis twist (OAT) operations and rotations. Our protocols are explicitly described in terms of multiple OAT angles whose durations decrease polynomially with system size and spin-squeezing parameters that decay as $N^{-μ}$, with $μ>2/3$ in most cases. Using numerical computation of the system-size dependence $N^{-ν}$ of the Bayesian mean-squared error of an estimator, we show that these states are suitable for use in the phase estimation scheme, and highlight the protocols to achieve $ν=17/9$ and $53/27$ using two and three OAT operations respectively in the last adaptation stage. We also analyze the limited non-Gaussianity of the resulting probe states and discuss the role of non-Gaussianity in this protocol more generally. Finally, we analyze how robust these protocols are with respect to imperfections such as particle number fluctuations and coherent control fluctuations.

quant-ph↗

arXiv2026

Quantum contextuality with mixed states of 1D symmetry-protected topological order

Bell theorems of many-body nonlocality and contextuality serve as a benchmark for proving quantum advantage in that a quantum computer outperforms a classical computer for a certain problem. In practice, however, near-term quantum devices do not prepare perfectly pure states but rather mixed states produced from noisy channels. We investigate noisy quantum advantage by considering thermal mixed states of one-dimensional many-body systems with a symmetry-protected topological (SPT) order. In the pure-state (or zero-temperature) case, these states are known to be useful for measurement-based quantum computation, and to outperform classical computers in a many-body contextuality game, provided string order parameters (SOPs) of SPT are sufficiently large. Here, we show that quantum advantage in mixed states is measured by a combination of twisted SOP and symmetry representation expectation values. Using the minimally entangled typical thermal states algorithm, it is demonstrated that quantum advantage persists to a nonzero critical temperature for finite-sized instances of the many-body contextuality game. While this critical temperature goes to zero in the thermodynamic limit, it is relatively robust to system size, suggesting that these states remain useful for demonstrating genuine "quantumness" of noisy hardware in a scalable fashion. Finally, we show that the quantum winning probability is lower bounded by the global fidelity with the 1D cluster state, so that our contextuality game can provide an operational meaning to benchmark the capacity to create long-range order like SPT states in near-term experimental devices.

quant-ph↗

arXiv2025

Scaling up the transcorrelated density matrix renormalization group

Explicitly correlated methods, such as the transcorrelated method which shifts a Jastrow or Gutzwiller correlator from the wave function to the Hamiltonian, are designed for high-accuracy calculations of electronic structures, but their application to larger systems has been hampered by the computational cost. We develop improved techniques for the transcorrelated density matrix renormalization group (DMRG), in which the ground state of the transcorrelated Hamiltonian is represented as a matrix product state (MPS), and demonstrate large-scale calculations of the ground-state energy of the two-dimensional Fermi-Hubbard model. Our developments stem from three technical inventions: (i) constructing matrix product operators (MPO) of transcorrelated Hamiltonians with low bond dimension and high sparsity, (ii) exploiting the entanglement structure of the ground states to increase the accuracy of the MPS representation, and (iii) optimizing the non-linear parameter of the Gutzwiller correlator to mitigate the non-variational nature of the transcorrelated method. We examine systems of size up to $12 \times 12$ lattice sites, four times larger than previous transcorrelated DMRG studies, and demonstrate that transcorrelated DMRG yields significant improvements over standard non-transcorrelated DMRG for equivalent computational effort. Transcorrelated DMRG reduces the error of the ground state energy by $3\times$-$17 \times$, with the smallest improvement seen for a small system at half-filling and the largest improvement in a dilute closed-shell system.

cond-mat.str-el↗

arXiv2025

Phase transitions in (2 + 1)D subsystem-symmetric monitored quantum circuits

The interplay of unitary evolution and projective measurements is a modern interest in the study of many-body entanglement. On the one hand, the competition between these two processes leads to the recently discovered measurement-induced phase transition (MIPT). On the other hand, measurement-based quantum computation (MBQC) is a well-known computational paradigm where measurements simulate unitary evolution by utilizing the entanglement of special resources such as the two-dimensional (2D) cluster state. The entanglement properties enabling MBQC may be attributed to symmetry-protected topological (SPT) orders, particularly subsystem-symmetric topological (SSPT) orders. It was recently found that the one-dimensional cluster state may be associated with an SPT phase in random circuits respecting a global $\mathbb{Z}_2\times\mathbb{Z}_2$ symmetry, and furthermore that all phase transitions in this scenario belong to the same universality class. As resources with greater computational power feature greater symmetry, it is fruitful to investigate further any relationship between levels of symmetry in MIPTs and MBQC. In this paper we investigate MIPTs on a torus with three levels of symmetry-respecting unitary evolution interspersed by measurements. Although we find two area-law phases and one volume-law phase with distinct entanglement structures for each ensemble, the phase transition from the volume-law phase to the area-law phase associated with the 2D SSPT cluster state has variable correlation length exponent $ν$. Whereas $ν\approx 0.90$ for unconstrained Clifford unitaries and $ν\approx0.83$ for globally-symmetric Cliffords, subsystem-symmetric Cliffords feature a much smaller value $ν\approx 0.38$. We discuss how these distinct $ν$'s quantify spacetime response scales where quantum information is manipulated by single-qubit measurements as in MBQC.

quant-ph↗

arXiv2025

Macroproperties vs. Microstates in the Classical Simulation of Critical Phenomena in Quench Dynamics of 1D Ising Models

We study the tractability of classically simulating critical phenomena in the quench dynamics of one-dimensional transverse field Ising models (TFIMs) using highly truncated matrix product states (MPS). We focus on two paradigmatic examples: a dynamical quantum phase transition (DQPT) that occurs in nonintegrable long-range TFIMs, and the infinite-time correlation length of the integrable nearest-neighbor TFIM when quenched to the critical point. For the DQPT, we show that the order parameters can be efficiently simulated with surprisingly heavy truncation of the MPS bond dimension. This can be used to reliably extract critical properties of the phase transition, including critical exponents, even when the full many-body state is not simulated with high fidelity. The long-time correlation length near the critical point is more sensitive to the full many-body state fidelity, and generally requires a large bond dimension MPS. Nonetheless, we find that this can still be efficiently simulated with strongly truncated MPS because it can be extracted from the short-time behavior of the dynamics where entanglement is low. Our results demonstrate that while accurate calculation of the full many-body state (microstate) is typically intractable due to the volume-law growth of entanglement, a precise specification of an exact microstate may not be required when simulating phases of matter of many-body systems (macrostates). We also study the tractability of simulation using truncated MPS based on quantum chaos and equilibration in the models. We find a counterintuitive inverse relationship, whereby local expectation values are most easily approximated for chaotic systems whose exact many-body state is most intractable.

quant-ph↗

arXiv2024

Quantum algorithms for classical Boolean functions via adaptive measurements: Exponential reductions in space-time resources

The limited computational power of constant-depth quantum circuits can be boosted by adapting future gates according to the outcomes of mid-circuit measurements. We formulate computation of a variety of Boolean functions in the framework of adaptive measurement-based quantum computation using a cluster state resource and a classical side-processor that can add bits modulo 2, so-called $l2$-MBQC. Our adaptive approach overcomes a known challenge that computing these functions in the nonadaptive setting requires a resource state that is exponentially large in the size of the computational input. In particular, we construct adaptive $l2$-MBQC algorithms based on the quantum signal processing technique that compute the mod-$p$ functions with the best known scaling in the space-time resources (i.e., qubit count, quantum circuit depth, classical memory size, and number of calls to the side-processor). As the subject is diverse and has a long history, the paper includes reviews of several previously constructed algorithms and recasts them as adaptive $l2$-MBQCs using cluster state resources. Our results constitute an alternative proof of an old theorem regarding an oracular separation between the power of constant-depth quantum circuits and constant-depth classical circuits with unbounded fan-in NAND and mod-$p$ gates for any prime $p$.

quant-ph↗

arXiv2024

Hardness results for decoding the surface code with Pauli noise

Real quantum computers will be subject to complicated, qubit-dependent noise, instead of simple noise such as depolarizing noise with the same strength for all qubits. We can do quantum error correction more effectively if our decoding algorithms take into account this prior information about the specific noise present. This motivates us to consider the complexity of surface code decoding where the input to the decoding problem is not only the syndrome-measurement results, but also a noise model in the form of probabilities of single-qubit Pauli errors for every qubit. In this setting, we show that quantum maximum likelihood decoding (QMLD) and degenerate quantum maximum likelihood decoding (DQMLD) for the surface code are NP-hard and #P-hard, respectively. We reduce directly from SAT for QMLD, and from #SAT for DQMLD, by showing how to transform a boolean formula into a qubit-dependent Pauli noise model and set of syndromes that encode the satisfiability properties of the formula. We also give hardness of approximation results for QMLD and DQMLD. These are worst-case hardness results that do not contradict the empirical fact that many efficient surface code decoders are correct in the average case (i.e., for most sets of syndromes and for most reasonable noise models). These hardness results are nicely analogous with the known hardness results for QMLD and DQMLD for arbitrary stabilizer codes with independent $X$ and $Z$ noise.

quant-ph↗

arXiv2024

Group-theoretic error mitigation enabled by classical shadows and symmetries

Estimating expectation values is a key subroutine in quantum algorithms. Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in devices without quantum error correction. To address these challenges simultaneously, we develop a quantum error-mitigation strategy called ``symmetry-adjusted classical shadows,'' by adjusting classical-shadow tomography according to how symmetries are corrupted by device errors. As a concrete example, we highlight global $\mathrm{U(1)}$ symmetry, which manifests in fermions as particle number and in spins as total magnetization, and illustrate their group-theoretic unification with respective classical-shadow protocols. We establish rigorous sampling bounds under readout errors obeying minimal assumptions, and perform numerical experiments with a more comprehensive model of gate-level errors derived from existing quantum processors. Our results reveal symmetry-adjusted classical shadows as a low-cost strategy to mitigate errors from noisy quantum experiments in the ubiquitous presence of symmetry.

quant-ph↗

arXiv2024

Optimizing one-axis twists for variational Bayesian quantum metrology

Quantum metrology and sensing seek advantage in estimating an unknown parameter of some quantum state or channel, using entanglement such as spin squeezing produced by one-axis twists or other quantum resources. In particular, qubit phase estimation, or rotation sensing, appears as a ubiquitous problem with applications to electric field sensing, magnetometry, atomic clocks, and gyroscopes. By adopting the Bayesian formalism to the phase estimation problem to account for limited initial knowledge about the value of the phase, we formulate variational metrology and treat the state preparation (or encoding) and measurement (or decoding) procedures as parameterized quantum circuits. It is important to understand how effective various parametrized protocols are as well as how robust they are to the effects of complex noise such as spatially correlated noise. First, we propose a new family of parametrized encoding and decoding protocols called arbitrary-axis twist ansatzes, and show that it can lead to a substantial reduction in the number of one-axis twists needed to achieve a target estimation error. Furthermore, we demonstrate that the estimation error associated with these strategies decreases with system size in a faster manner than classical (or no-twists) protocols, even in the less-explored regimes where the prior information is limited. Last, using a polynomial-size tensor network algorithm, we numerically analyze practical variational metrology beyond the symmetric subspace of a collective spin, and find that quantum advantage persists for the arbitrary-axis twist ansatzes with a few one-axis twists and smaller total twisting angles for practically relevant noise levels.

quant-ph↗

arXiv2022

Fermionic partial tomography via classical shadows

We propose a tomographic protocol for estimating any $ k $-body reduced density matrix ($ k $-RDM) of an $ n $-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all $ k $-RDM elements to additive precision $ \varepsilon $ requires on the order of $ \binom{n}{k} k^{3/2} \log(n) / \varepsilon^2 $ repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for $ k \geq 2 $, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2-5 times more repetitions.

quant-ph↗

arXiv2022

Quantum computational advantage attested by nonlocal games with the cyclic cluster state

We propose a set of Bell-type nonlocal games that can be used to prove an unconditional quantum advantage in an objective and hardware-agnostic manner. In these games, the circuit depth needed to prepare a cyclic cluster state and measure a subset of its Pauli stabilizers on a quantum computer is compared to that of classical Boolean circuits with the same, nearest-neighboring gate connectivity. Using a circuit-based trapped-ion quantum computer, we prepare and measure a six-qubit cyclic cluster state with an overall fidelity of 60.6% and 66.4%, before and after correcting for measurement-readout errors, respectively. Our experimental results indicate that while this fidelity readily passes conventional (or depth-0) Bell bounds for local hidden-variable models, it is on the cusp of demonstrating a higher probability of success than what is possible by depth-1 classical circuits. Our games offer a practical and scalable set of quantitative benchmarks for quantum computers in the pre-fault-tolerant regime as the number of qubits available increases.

quant-ph↗

arXiv2021

Quantum computational advantage with string order parameters of 1D symmetry-protected topological order

Nonlocal games with advantageous quantum strategies give arguably the most fundamental demonstration of the power of quantum resources over their classical counterparts. Recently, certain multiplayer generalizations of nonlocal games have been used to prove unconditional separations between small computational complexity classes of shallow-depth circuits. Here, we show advantageous strategies for these nonlocal games for generic ground states of one-dimensional symmetry-protected topological orders (SPTOs), when a discrete invariant of a SPTO known as a twist phase is nontrivial and -1. Our construction demonstrates that sufficiently large string order parameters of such SPTOs are indicative of globally constrained correlations useful for the unconditional computational separation.

quant-ph↗

arXiv2020

Measurement reduction in variational quantum algorithms

Variational quantum algorithms are promising applications of noisy intermediate-scale quantum (NISQ) computers. These algorithms consist of a number of separate prepare-and-measure experiments that estimate terms in a Hamiltonian. The number of terms can become overwhelmingly large for problems at the scale of NISQ hardware that may soon be available. We approach this problem from the perspective of contextuality, and use unitary partitioning (developed independently by Izmaylov et al. [J. Chem. Theory Comput. 16, 190 (2020)]) to define variational quantum eigensolver procedures in which additional unitary operations are appended to the ansatz preparation to reduce the number of terms. This approach may be scaled to use all coherent resources available after ansatz preparation. We also study the use of asymmetric qubitization to implement the additional coherent operations with lower circuit depth. We investigate this technique for lattice Hamiltonians, random Pauli Hamiltonians, and electronic structure Hamiltonians. Using this technique, we find a constant factor speedup for lattice and random Pauli Hamiltonians. For electronic structure Hamiltonians, we prove that linear term reduction with respect to the number of orbitals, which has been previously observed in numerical studies, is always achievable. For systems represented on 10--30 qubits, we find that there is a reduction in the number of terms by approximately an order of magnitude. Applied to the plane-wave dual basis representation of fermionic Hamiltonians, however, unitary partitioning offers only a constant factor reduction. Finally, we show that noncontextual Hamiltonians may be reduced to effective commuting Hamiltonians using unitary partitioning.

quant-ph↗

arXiv2020

Computational universality of symmetry-protected topologically ordered cluster phases on 2D Archimedean lattices

What kinds of symmetry-protected topologically ordered (SPTO) ground states can be used for universal measurement-based quantum computation in a similar fashion to the 2D cluster state? 2D SPTO states are classified not only by global on-site symmetries but also by subsystem symmetries, which are fine-grained symmetries dependent on the lattice geometry. Recently, all states within so-called SPTO cluster phases on the square and hexagonal lattices have been shown to be universal, based on the presence of subsystem symmetries and associated structures of quantum cellular automata. Motivated by this observation, we analyze the computational capability of SPTO cluster phases on all vertex-translative 2D Archimedean lattices. There are four subsystem symmetries here called ribbon, cone, fractal, and 1-form symmetries, and the former three are fundamentally in one-to-one correspondence with three classes of Clifford quantum cellular automata. We conclude that nine out of the eleven Archimedean lattices support universal cluster phases protected by one of the former three symmetries, while the remaining lattices possess 1-form symmetries and have a different capability related to error correction.

quant-ph↗

arXiv2019

Quantum computational supremacy in the sampling of bosonic random walkers on a one-dimensional lattice

We study the sampling complexity of a probability distribution associated with an ensemble ofidentical noninteracting bosons undergoing a quantum random walk on a one-dimensional lattice.With uniform nearest-neighbor hopping we show that one can efficiently sample the distribution fortimes logarithmic in the size of the system, while for longer times there is no known efficient samplingalgorithm. With time-dependent hopping and optimal control, we design the time evolution toapproximate an arbitrary Haar-random unitary map analogous to that designed for photons in alinear optical network. This approach highlights a route to generating quantum complexity byoptimal control only of a single-body unitary matrix. We study this in the context of two potentialexperimental realizations: a spinor optical lattice of ultracold atoms and a quantum gas microscope.

quant-ph↗

arXiv2019

Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states

While the circuit model of quantum computation defines its logical depth or "computational time" in terms of temporal gate sequences, the measurement-based model could allow totally different temporal ordering and parallelization of logical gates. By developing techniques to analyze Pauli measurements on multi-qubit hypergraph states generated by the Controlled-Controlled-Z (CCZ) gates, we introduce a deterministic scheme of universal measurement-based computation. In contrast to the cluster-state scheme, where the Clifford gates are parallelizable, our scheme enjoys massive parallelization of CCZ and SWAP gates, so that the computational depth grows with the number of global applications of Hadamard gates, or, in other words, with the number of changing computational bases. A logarithmic-depth implementation of an N-times Controlled-Z gate illustrates a novel trade-off between space and time complexity.

quant-ph↗

arXiv2018

Many-body-localization transition in a universal quantum circuit model

The dynamical generation of complex correlations in quantum many-body systems is of renewed interest in the context of quantum chaos, where the out-of-time-ordered (OTO) correlation function appears as a convenient measure of scrambling. To detect the the transition from scrambling to many-body localization, the latter of which has limited dynamical complexity and is often classically simulatable, we develop both exact and approximate methods to compute OTO correlators for arbitrary universal quantum circuits. We take advantage of the mapping of quantum circuits to the dynamics of interacting fermions in one dimension, as Gaussian time evolution supplemented by quartic interaction gates. In this framework, the OTO correlator can be calculated exactly as a superposition of exponentially many Gaussian-fermionic trajectories in the number of interaction gates. We develop a variationally-optimized, Gaussian approximation to the spatial propagation of an initially-local operator by restriction to the fastest-traveling fermionic modes, in a similar spirit as light-front computational methods in quantum field theory. We demonstrate that our method can detect the many-body localization transitions of generally time-dependent dynamics without the need for perturbatively weak interactions.

quant-ph↗