arXiv subjects

Chi-Fang Chen

Publications and source records attributed to Chi-Fang Chen.

36 records · Page 2Linked to original sources

arXiv2024

Optimizing random local Hamiltonians by dissipation

A central challenge in quantum simulation is to prepare low-energy states of strongly interacting many-body systems. In this work, we study the problem of preparing a quantum state that optimizes a random all-to-all, sparse or dense, spin or fermionic $k$-local Hamiltonian. We prove that a simplified quantum Gibbs sampling algorithm achieves a $Ω(\frac{1}{k})$-fraction approximation of the optimum, giving an exponential improvement on the $k$-dependence over the prior best (both classical and quantum) algorithmic guarantees. Combined with the circuit lower bound for such states, our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial. This further indicates that quantum Gibbs sampling may be a suitable metaheuristic for optimization problems.

quant-ph↗

arXiv2024

Quantum computational advantage with constant-temperature Gibbs sampling

A quantum system coupled to a bath at some fixed, finite temperature converges to its Gibbs state. This thermalization process defines a natural, physically-motivated model of quantum computation. However, whether quantum computational advantage can be achieved within this realistic physical setup has remained open, due to the challenge of finding systems that thermalize quickly, but are classically intractable. Here we consider sampling from the measurement outcome distribution of quantum Gibbs states at constant temperatures, and prove that this task demonstrates quantum computational advantage. We design a family of commuting local Hamiltonians (parent Hamiltonians of shallow quantum circuits) and prove that they rapidly converge to their Gibbs states under the standard physical model of thermalization (as a continuous-time quantum Markov chain). On the other hand, we show that no polynomial time classical algorithm can sample from the measurement outcome distribution by reducing to the classical hardness of sampling from noiseless shallow quantum circuits. The key step in the reduction is constructing a fault-tolerance scheme for shallow IQP circuits against input noise.

quant-ph↗

arXiv2024

Single-ancilla ground state preparation via Lindbladians

We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this Lindbladian is algorithmic and should not be seen as a specific approximation to some weakly coupled system-bath dynamics in nature. Our algorithm can be implemented using just one ancilla qubit and efficiently simulated on a quantum computer. It can prepare the ground state even when the initial state has zero overlap with the ground state, bypassing the most significant limitation of methods like quantum phase estimation. As a variant, we also propose a discrete-time algorithm, demonstrating even better efficiency and providing a near-optimal simulation cost depending on the desired evolution time and precision. Numerical simulation using Ising and Hubbard models demonstrates the efficacy and applicability of our method.

quant-ph↗

arXiv2024

Efficient Unitary T-designs from Random Sums

Unitary $T$-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. Until now, the most efficient construction of unitary $T$-designs for $n$-qudit systems has been via random local quantum circuits, which have been shown to converge to approximate $T$-designs in the diamond norm using $O(T^{5+o(1)} n^2)$ quantum gates. In this work, we provide a new construction of $T$-designs via random matrix theory using $\tilde{O}(T^2 n^2)$ quantum gates. Our construction leverages two key ideas. First, in the spirit of central limit theorems, we approximate the Gaussian Unitary Ensemble (GUE) by an i.i.d. sum of random Hermitian matrices. Second, we show that the product of just two exponentiated GUE matrices is already approximately Haar random. Thus, multiplying two exponentiated sums over rather simple random matrices yields a unitary $T$-design, via Hamiltonian simulation. A central feature of our proof is a new connection between the polynomial method in quantum query complexity and the large-dimension ($N$) expansion in random matrix theory. In particular, we show that the polynomial method provides exponentially improved bounds on the high moments of certain random matrix ensembles, without requiring intricate Weingarten calculations. In doing so, we define and solve a new type of moment problem on the unit circle, asking whether a finite number of equally weighted points, corresponding to eigenvalues of unitary matrices, can reproduce a given set of moments.

quant-ph↗

arXiv2023

Quantum Thermal State Preparation

Preparing ground states and thermal states is essential for simulating quantum systems on quantum computers. Despite the hope for practical quantum advantage in quantum simulation, popular state preparation approaches have been challenged. Monte Carlo-style quantum Gibbs samplers have emerged as an alternative, but prior proposals have been unsatisfactory due to technical obstacles rooted in energy-time uncertainty. We introduce simple continuous-time quantum Gibbs samplers that overcome these obstacles by efficiently simulating Nature-inspired quantum master equations (Lindbladians). In addition, we construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states (called thermal field double states in high-energy physics) of rapidly thermalizing systems; this algorithm also benefits from a quantum walk speedup. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time (or spectral gap) of the relevant Lindbladian. We complete the first rigorous proof of finite-time thermalization for physically derived Lindbladians by developing a general analytic framework for nonasymptotic secular approximation and approximate detailed balance. Given the success of classical Markov chain Monte Carlo (MCMC) algorithms and the ubiquity of thermodynamics, we anticipate that quantum Gibbs sampling will become indispensable in quantum computing.

quant-ph↗

arXiv2023

Local minima in quantum systems

Finding ground states of quantum many-body systems is known to be hard for both classical and quantum computers. As a result, when Nature cools a quantum system in a low-temperature thermal bath, the ground state cannot always be found efficiently. Instead, Nature finds a local minimum of the energy. In this work, we study the problem of finding local minima in quantum systems under thermal perturbations. While local minima are much easier to find than ground states, we show that finding a local minimum is computationally hard for classical computers, even when the task is to output a single-qubit observable at any local minimum. In contrast, we prove that a quantum computer can always find a local minimum efficiently using a thermal gradient descent algorithm that mimics the cooling process in Nature. To establish the classical hardness of finding local minima, we consider a family of two-dimensional Hamiltonians such that any problem solvable by polynomial-time quantum algorithms can be reduced to finding ground states of these Hamiltonians. We prove that for such Hamiltonians, all local minima are global minima. Therefore, assuming quantum computation is more powerful than classical computation, finding local minima is classically hard and quantumly easy.

quant-ph↗

arXiv2023

Speed limits and locality in many-body quantum dynamics

We review the mathematical speed limits on quantum information processing in many-body systems. After the proof of the Lieb-Robinson Theorem in 1972, the past two decades have seen substantial developments in its application to other questions, such as the simulatability of quantum systems on classical or quantum computers, the generation of entanglement, and even the properties of ground states of gapped systems. Moreover, Lieb-Robinson bounds have been extended in non-trivial ways, to demonstrate speed limits in systems with power-law interactions or interacting bosons, and even to prove notions of locality that arise in cartoon models for quantum gravity with all-to-all interactions. We overview the progress which has occurred, highlight the most promising results and techniques, and discuss some central outstanding questions which remain open. To help bring newcomers to the field up to speed, we provide self-contained proofs of the field's most essential results.

quant-ph↗

arXiv2023

Matrix Product Density Operators: when do they have a local parent Hamiltonian?

We study whether one can write a Matrix Product Density Operator (MPDO) as the Gibbs state of a quasi-local parent Hamiltonian. We conjecture this is the case for generic MPDO and give supporting evidences. To investigate the locality of the parent Hamiltonian, we take the approach of checking whether the quantum conditional mutual information decays exponentially. The MPDO we consider are constructed from a chain of 1-input/2-output (`Y-shaped') completely-positive maps, i.e., the MPDO have a local purification. We derive an upper bound on the conditional mutual information for bistochastic channels and strictly positive channels and show that it decays exponentially if the correctable algebra of the channel is trivial. We also introduce a conjecture on a quantum data processing inequality that implies the exponential decay of the conditional mutual information for every Y-shaped channel with trivial correctable algebra. We additionally investigate a close but nonequivalent cousin: MPDO measured in a local basis. We provide sufficient conditions for the exponential decay of the conditional mutual information of the measured states and numerically confirm they are generically true for certain random MPDO.

quant-ph↗

arXiv2023

Fast Thermalization from the Eigenstate Thermalization Hypothesis

The Eigenstate Thermalization Hypothesis (ETH) has played a major role in understanding thermodynamic phenomena in closed quantum systems. However, its connection to the timescale of thermalization for open system dynamics has remained elusive. This paper establishes a rigorous link between ETH and fast thermalization to the global Gibbs state. Specifically, we demonstrate fast thermalization for a system coupled weakly to a bath of quasi-free Fermions that we refresh periodically. To describe the joint evolution, we derive a finite-time version of Davies' generator with explicit error bounds and resource estimates. Our approach exploits a critical feature of ETH: operators in the energy basis can be modeled by independent random matrices in a near-diagonal band. This gives quantum expanders at nearby eigenstates of the Hamiltonian and reduces the problem to a one-dimensional classical random walk on the energy eigenstates. Our results explain finite-time thermalization in chaotic open quantum systems.

quant-ph↗

arXiv2022

Hierarchy of linear light cones with long-range interactions

In quantum many-body systems with local interactions, quantum information and entanglement cannot spread outside of a linear light cone, which expands at an emergent velocity analogous to the speed of light. Local operations at sufficiently separated spacetime points approximately commute -- given a many-body state, $\mathcal{O}_x(t) \mathcal{O}_y |ψ\rangle \approx \mathcal{O}_y\mathcal{O}_x(t) |ψ\rangle$ with arbitrarily small errors -- so long as $|x-y|\gtrsim vt$, where $v$ is finite. Yet most non-relativistic physical systems realized in nature have long-range interactions: two degrees of freedom separated by a distance $r$ interact with potential energy $V(r) \propto 1/r^α$. In systems with long-range interactions, we rigorously establish a hierarchy of linear light cones: at the same $α$, some quantum information processing tasks are constrained by a linear light cone while others are not. In one spatial dimension, this linear light cone exists for every many-body state when $α>3$ (Lieb-Robinson light cone); for a typical state chosen uniformly at random from the Hilbert space when $α>\frac{5}{2}$ (Frobenius light cone); for every state of a non-interacting system when $α>2$ (free light cone). These bounds apply to time-dependent systems and are optimal up to subalgebraic improvements. Our theorems regarding the Lieb-Robinson and free light cones -- and their tightness -- also generalize to arbitrary dimensions. We discuss the implications of our bounds on the growth of connected correlators and of topological order, the clustering of correlations in gapped systems, and the digital simulation of systems with long-range interactions. In addition, we show that universal quantum state transfer, as well as many-body quantum chaos, are bounded by the Frobenius light cone, and therefore are poorly constrained by all Lieb-Robinson bounds.

quant-ph↗

arXiv2021

Optimal Frobenius light cone in spin chains with power-law interactions

In many-body quantum systems with spatially local interactions, quantum information propagates with a finite velocity, reminiscent of the ``light cone" of relativity. In systems with long-range interactions which decay with distance $r$ as $1/r^α$, however, there are multiple light cones which control different information theoretic tasks. We show an optimal (up to logarithms) ``Frobenius light cone" obeying $t\sim r^{\min(α-1,1)}$ for $α>1$ in one-dimensional power-law interacting systems with finite local dimension: this controls, among other physical properties, the butterfly velocity characterizing many-body chaos and operator growth. We construct an explicit random Hamiltonian protocol that saturates the bound and settles the optimal Frobenius light cone in one dimension. We partially extend our constraints on the Frobenius light cone to a several operator $p$-norms, and show that Lieb-Robinson bounds can be saturated in at most an exponentially small $e^{-Ω(r)}$ fraction of the many-body Hilbert space.

quant-ph↗

arXiv2021

Operator growth bounds from graph theory

Let $A$ and $B$ be local operators in Hamiltonian quantum systems with $N $ degrees of freedom and finite-dimensional Hilbert space. We prove that the commutator norm $\lVert [A(t),B]\rVert$ is upper bounded by a topological combinatorial problem: counting irreducible weighted paths between two points on the Hamiltonian's factor graph. Our bounds sharpen existing Lieb-Robinson bounds by removing extraneous growth. In quantum systems drawn from zero-mean random ensembles with few-body interactions, we prove stronger bounds on the ensemble-averaged out-of-time-ordered correlator $\mathbb{E}\left[ \lVert [A(t),B]\rVert_F^2\right]$. In such quantum systems on Erdös-Rényi factor graphs, we prove that the scrambling time $t_{\mathrm{s}}$, at which $\lvert [A(t),B]\rVert_F=\mathrmΘ(1)$, is almost surely $t_{\mathrm{s}}=\mathrmΩ(\sqrt{\log N})$; we further prove $t_{\mathrm{s}}=\mathrmΩ(\log N) $ to high order in perturbation theory in $1/N$. We constrain infinite temperature quantum chaos in the $q$-local Sachdev-Ye-Kitaev model at any order in $1/N$; at leading order, our upper bound on the Lyapunov exponent is within a factor of 2 of the known result at any $q>2$. We also speculate on the implications of our theorems for conjectured holographic descriptions of quantum gravity.

math-ph↗

arXiv2021

Concentration of OTOC and Lieb-Robinson velocity in random Hamiltonians

The commutator between operators at different space and time has been a diagnostic for locality of unitary evolution. Most existing results are either for specific tractable (random) Hamiltonians(Out-of-Time-Order-Correlators calculations), or for worse case Hamiltonians (Lieb-Robinson-like bounds or OTOC bounds). In this work, we study commutators in typical Hamiltonians. Draw a sample from any zero-mean bounded independent random Hamiltonian ensemble, time-independent or Brownian, we formulate concentration bounds in the spectral norm and for the OTOC with arbitrary non-random state. Our bounds hold with high probability and scale with the sum of interactions squared. Our Brownian bounds are compatible with the Brownian limit while deterministic operator growth bounds must diverge. We evaluate this general framework on short-ranged, 1d power-law interacting, and SYK-like k-local systems and the results match existing lower bounds and conjectures. Our main probabilistic argument employs a robust matrix martingale technique called uniform smoothness and may be applicable in other settings.

quant-ph↗

arXiv2019

Finite speed of quantum scrambling with long range interactions

In a locally interacting many-body system, two isolated qubits, separated by a large distance $r$, become correlated and entangled with each other at a time $t \ge r/v$. This finite speed $v$ of quantum information scrambling limits quantum information processing, thermalization and even equilibrium correlations. Yet most experimental systems contain long range power law interactions -- qubits separated by $r$ have potential energy $V(r)\propto r^{-α}$. Examples include the long range Coulomb interactions in plasma ($α=1$) and dipolar interactions between spins ($α=3$). In one spatial dimension, we prove that the speed of quantum scrambling remains finite for sufficiently large $α$. This result parametrically improves previous bounds, compares favorably with recent numerical simulations, and can be realized in quantum simulators with dipolar interactions. Our new mathematical methods lead to improved algorithms for classically simulating quantum systems, and improve bounds on environmental decoherence in experimental quantum information processors.

quant-ph↗

arXiv2019

Team NCTU: Toward AI-Driving for Autonomous Surface Vehicles -- From Duckietown to RobotX

Robotic software and hardware systems of autonomous surface vehicles have been developed in transportation, military, and ocean researches for decades. Previous efforts in RobotX Challenges 2014 and 2016 facilitates the developments for important tasks such as obstacle avoidance and docking. Team NCTU is motivated by the AI Driving Olympics (AI-DO) developed by the Duckietown community, and adopts the principles to RobotX challenge. With the containerization (Docker) and uniformed AI agent (with observations and actions), we could better 1) integrate solutions developed in different middlewares (ROS and MOOS), 2) develop essential functionalities of from simulation (Gazebo) to real robots (either miniaturized or full-sized WAM-V), and 3) compare different approaches either from classic model-based or learning-based. Finally, we setup an outdoor on-surface platform with localization services for evaluation. Some of the preliminary results will be presented for the Team NCTU participations of the RobotX competition in Hawaii in 2018.

cs.RO↗

arXiv2019

Entanglement Wedge Reconstruction using the Petz Map

At the heart of recent progress in AdS/CFT is the question of subregion duality, or entanglement wedge reconstruction: which part(s) of the boundary CFT are dual to a given subregion of the bulk? This question can be answered by appealing to the quantum error correcting properties of holography, and it was recently shown that robust bulk (entanglement wedge) reconstruction can be achieved using a universal recovery channel known as the twirled Petz map. In short, one can use the twirled Petz map to recover bulk data from a subset of the boundary. However, this map involves an averaging procedure over bulk and boundary modular time, and hence it can be somewhat intractable to evaluate in practice. We show that a much simpler channel, the Petz map, is sufficient for entanglement wedge reconstruction for any code space of fixed finite dimension - no twirling is required. Moreover, the error in the reconstruction will always be non-perturbatively small. From a quantum information perspective, we prove a general theorem extending the use of the Petz map as a general-purpose recovery channel to subsystem and operator algebra quantum error correction.

hep-th↗

arXiv2017

Origin of the Drude peak and of zero sound in probe brane holography

At zero temperature, the charge current operator appears to be conserved, within linear response, in certain holographic probe brane models of strange metals. At small but finite temperature, we analytically show that the weak non-conservation of this current leads to both a collective "zero sound" mode and a Drude peak in the electrical conductivity. This simultaneously resolves two outstanding puzzles about probe brane theories. The nonlinear dynamics of the current operator itself appears qualitatively different.

hep-th↗

arXiv2017

Full-field cavity enhanced microscopy techniques

Quantum enhanced microscopy allows for measurements at high sensitivities and low damage. Recently, multi-pass microscopy was introduced as such a scheme, exploiting the sensitivity enhancement offered by multiple photon-sample interactions. Here we theoretically and numerically compare three different contrast enhancing techniques that are all based on self-imaging cavities: CW cavity enhanced microscopy, cavity ring-down microscopy and multi-pass microscopy. We show that all three schemes can lead to sensitivities beyond the standard quantum limit.

quant-ph↗