arXiv subjects

Isaac H. Kim

Publications and source records attributed to Isaac H. Kim.

At least 55 records · Page 3Linked to original sources

arXiv2021

Entropy scaling law and the quantum marginal problem: simplification and generalization

Recently, we introduced a solution to the quantum marginal problem relevant to two-dimensional quantum many-body systems [I. H. Kim, Phys. Rev. X, 11, 021039]. One of the conditions was that the marginals are internally translationally invariant. We show that this condition can be replaced by a weaker condition, namely the local consistency of the marginals. This extends the applicability of the solution to any quantum many-body states in two dimensions that satisfy the entropy scaling law, with or without symmetry. We also significantly simplify the proof by advocating the usage of the maximum-entropy principle.

quant-ph↗

arXiv2021

Entanglement bootstrap approach for gapped domain walls

We develop a theory of gapped domain wall between topologically ordered systems in two spatial dimensions. We find a new type of superselection sector -- referred to as the parton sector -- that subdivides the known superselection sectors localized on gapped domain walls. Moreover, we introduce and study the properties of composite superselection sectors that are made out of the parton sectors. We explain a systematic method to define these sectors, their fusion spaces, and their fusion rules, by deriving nontrivial identities relating their quantum dimensions and fusion multiplicities. We propose a set of axioms regarding the ground state entanglement entropy of systems that can host gapped domain walls, generalizing the bulk axioms proposed in [B. Shi, K. Kato, and I. H. Kim, Ann. Phys. 418, 168164 (2020)]. Similar to our analysis in the bulk, we derive our main results by examining the self-consistency relations of an object called information convex set. As an application, we define an analog of topological entanglement entropy for gapped domain walls and derive its exact expression.

cond-mat.str-el↗

arXiv2021

Domain wall topological entanglement entropy

We study the ground-state entanglement of gapped domain walls between topologically ordered systems in two spatial dimensions. We derive a universal correction to the ground-state entanglement entropy, which is equal to the logarithm of the total quantum dimension of a set of superselection sectors localized on the domain wall. This expression is derived from the recently proposed entanglement bootstrap method.

cond-mat.str-el↗

arXiv2021

Interleaving: Modular architectures for fault-tolerant photonic quantum computing

Useful fault-tolerant quantum computers require very large numbers of physical qubits. Quantum computers are often designed as arrays of static qubits executing gates and measurements. Photonic qubits require a different approach. In photonic fusion-based quantum computing (FBQC), the main hardware components are resource-state generators (RSGs) and fusion devices connected via waveguides and switches. RSGs produce small entangled states of a few photonic qubits, whereas fusion devices perform entangling measurements between different resource states, thereby executing computations. In addition, low-loss photonic delays such as optical fiber can be used as fixed-time quantum memories simultaneously storing thousands of photonic qubits. Here, we present a modular architecture for FBQC in which these components are combined to form "interleaving modules" consisting of one RSG with its associated fusion devices and a few fiber delays. Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space. Networks of modules are universal fault-tolerant quantum computers, which we demonstrate using surface codes and lattice surgery as a guiding example. Our numerical analysis shows that in a network of modules containing 1-km-long fiber delays, each RSG can generate four logical distance-35 surface-code qubits while tolerating photon loss rates above 2% in addition to the fiber-delay loss. We illustrate how the combination of interleaving with further uses of non-local fiber connections can reduce the cost of logical operations and facilitate the implementation of unconventional geometries such as periodic boundaries or stellated surface codes. Interleaving applies beyond purely optical architectures, and can also turn many small disconnected matter-qubit devices with transduction to photons into a large-scale quantum computer.

quant-ph↗

arXiv2021

Entropy scaling law and the quantum marginal problem

Quantum many-body states that frequently appear in physics often obey an entropy scaling law, meaning that an entanglement entropy of a subsystem can be expressed as a sum of terms that scale linearly with its volume and area, plus a correction term that is independent of its size. We conjecture that these states have an efficient dual description in terms of a set of marginal density matrices on bounded regions, obeying the same entropy scaling law locally. We prove a restricted version of this conjecture for translationally invariant systems in two spatial dimensions. Specifically, we prove that a translationally invariant marginal obeying three non-linear constraints -- all of which follow from the entropy scaling law straightforwardly -- must be consistent with some global state on an infinite lattice. Moreover, we derive a closed-form expression for the maximum entropy density compatible with those marginals, deriving a variational upper bound on the thermodynamic free energy. Our construction's main assumptions are satisfied exactly by solvable models of topological order and approximately by finite-temperature Gibbs states of certain quantum spin Hamiltonians.

quant-ph↗

arXiv2020

Recycling qubits in near-term quantum computers

Quantum computers are capable of efficiently contracting unitary tensor networks, a task that is likely to remain difficult for classical computers. For instance, networks based on matrix product states or the multi-scale entanglement renormalization ansatz (MERA) can be contracted on a small quantum computer to aid the simulation of a large quantum system. However, without the ability to selectively reset qubits, the associated spatial cost can be exorbitant. In this paper, we propose a protocol that can unitarily reset qubits when the circuit has a common convolutional form, thus dramatically reducing the spatial cost for implementing the contraction algorithm on general near-term quantum computers. This protocol generates fresh qubits from used ones by partially applying the time-reversed quantum circuit over qubits that are no longer in use. In the absence of noise, we prove that the state of a subset of these qubits becomes $|0\ldots 0\rangle$, up to an error exponentially small in the number of gates applied. We also provide a numerical evidence that the protocol works in the presence of noise. We also provide a numerical evidence that the protocol works in the presence of noise, and formulate a condition under which the noise-resilience follows rigorously.

quant-ph↗

arXiv2020

An exactly solvable ansatz for statistical mechanics models

We propose a family of "exactly solvable" probability distributions to approximate partition functions of two-dimensional statistical mechanics models. While these distributions lie strictly outside the mean-field framework, their free energies can be computed in a time that scales linearly with the system size. This construction is based on a simple but nontrivial solution to the marginal problem. We formulate two non-linear constraints on the set of locally consistent marginal probabilities that simultaneously (i) ensure the existence of a consistent global probability distribution and (ii) lead to an exact expression for the maximum global entropy.

cond-mat.stat-mech↗

arXiv2020

Fusion rules from entanglement

We derive some of the axioms of the algebraic theory of anyon [A. Kitaev, Ann. Phys., 321, 2 (2006)] from a conjectured form of entanglement area law for two-dimensional gapped systems. We derive the fusion rules of topological charges and show that the multiplicities of the fusion rules satisfy these axioms. Moreover, even though we make no assumption about the exact value of the constant sub-leading term of the entanglement entropy of a disk-like region, this term is shown to be equal to $\ln \mathcal{D}$, where $\mathcal{D}$ is the total quantum dimension of the underlying anyon theory. These derivations are rigorous and follow from the entanglement area law alone. More precisely, our framework starts from two local entropic constraints, which are implied by the area law. From these constraints, we prove what we refer to as the "isomorphism theorem." The existence of superselection sectors and fusion multiplicities follows from this theorem, even without assuming anything about the parent Hamiltonian. These objects and the axioms of the anyon theory are shown to emerge from the structure and the internal self-consistency relations of the information convex sets.

cond-mat.str-el↗

arXiv2020

The ghost in the radiation: Robust encodings of the black hole interior

We reconsider the black hole firewall puzzle, emphasizing that quantum error-correction, computational complexity, and pseudorandomness are crucial concepts for understanding the black hole interior. We assume that the Hawking radiation emitted by an old black hole is pseudorandom, meaning that it cannot be distinguished from a perfectly thermal state by any efficient quantum computation acting on the radiation alone. We then infer the existence of a subspace of the radiation system which we interpret as an encoding of the black hole interior. This encoded interior is entangled with the late outgoing Hawking quanta emitted by the old black hole, and is inaccessible to computationally bounded observers who are outside the black hole. Specifically, efficient operations acting on the radiation, those with quantum computational complexity polynomial in the entropy of the remaining black hole, commute with a complete set of logical operators acting on the encoded interior, up to corrections which are exponentially small in the entropy. Thus, under our pseudorandomness assumption, the black hole interior is well protected from exterior observers as long as the remaining black hole is macroscopic. On the other hand, if the radiation is not pseudorandom, an exterior observer may be able to create a firewall by applying a polynomial-time quantum computation to the radiation.

hep-th↗

arXiv2019

Sorting topological stabilizer models in three dimensions

The S-matrix invariant is known to be complete for translation invariant topological stabilizer models in two spatial dimensions, as such models are phase equivalent to some number of copies of toric code. In three dimensions, much less is understood about translation invariant topological stabilizer models due to the existence of fracton topological order. Here we introduce bulk commutation quantities inspired by the 2D S-matrix invariant that can be employed to coarsely sort 3D topological stabilizer models into qualitatively distinct types of phases: topological quantum field theories, foliated or fractal type-I models with rigid string operators, or type-II models with no string operators.

quant-ph↗

arXiv2019

Noise reduction using past causal cones in variational quantum algorithms

We introduce an approach to improve the accuracy and reduce the sample complexity of near term quantum-classical algorithms. We construct a simpler initial parameterized quantum state, or ansatz, based on the past causal cone of each observable, generally yielding fewer qubits and gates. We implement this protocol on a trapped ion quantum computer and demonstrate improvement in accuracy and time-to-solution at an arbitrary point in the variational search space. We report a $\sim 27\%$ improvement in the accuracy of the calculation of the deuteron binding energy and $\sim 40\%$ improvement in the accuracy of the quantum approximate optimization of the MAXCUT problem applied to the dragon graph $T_{3,2}$. When the time-to-solution is prioritized over accuracy, the former requires $\sim 71\%$ fewer measurements and the latter requires $\sim 78\%$ fewer measurements.

quant-ph↗

arXiv2017

Robust entanglement renormalization on a noisy quantum computer

A method to study strongly interacting quantum many-body systems at and away from criticality is proposed. The method is based on a MERA-like tensor network that can be efficiently and reliably contracted on a noisy quantum computer using a number of qubits that is much smaller than the system size. We prove that the outcome of the contraction is stable to noise and that the estimated energy upper bounds the ground state energy. The stability, which we numerically substantiate, follows from the positivity of operator scaling dimensions under renormalization group flow. The variational upper bound follows from a particular assignment of physical qubits to different locations of the tensor network plus the assumption that the noise model is local. We postulate a scaling law for how well the tensor network can approximate ground states of lattice regulated conformal field theories in d spatial dimensions and provide evidence for the postulate. Under this postulate, a $O(\log^{d}(1/δ))$-qubit quantum computer can prepare a valid quantum-mechanical state with energy density $δ$ above the ground state. In the presence of noise, $δ= O(ε\log^{d+1}(1/ε))$ can be achieved, where $ε$ is the noise strength.

quant-ph↗

arXiv2017

Markovian Matrix Product Density Operators : Efficient computation of global entropy

We introduce the Markovian matrix product density operator, which is a special subclass of the matrix product density operator. We show that the von Neumann entropy of such ansatz can be computed efficiently on a classical computer. This is possible because one can efficiently certify that the global state forms an approximate quantum Markov chain by verifying a set of inequalities. Each of these inequalities can be verified in time that scales polynomially with the bond dimension and the local Hilbert space dimension. The total number of inequalities scale linearly with the system size. We use this fact to study the complexity of computing the minimum free energy of local Hamiltonians at finite temperature. To this end, we introduce the free energy problem as a generalization of the local Hamiltonian problem, and study its complexity for a class of Hamiltonians that describe quantum spin chains. The corresponding free energy problem at finite temperature is in NP if the Gibbs state of such Hamiltonian forms an approximate quantum Markov chain with an error that decays exponentially with the width of the conditioning subsystem.

quant-ph↗

arXiv2017

Entanglement renormalization, quantum error correction, and bulk causality

Entanglement renormalization can be viewed as an encoding circuit for a family of approximate quantum error correcting codes. The logical information becomes progressively more well-protected against erasure errors at larger length scales. In particular, an approximate variant of holographic quantum error correcting code emerges at low energy for critical systems. This implies that two operators that are largely separated in scales behave as if they are spatially separated operators, in the sense that they obey a Lieb-Robinson type locality bound under a time evolution generated bya local Hamiltonian.

quant-ph↗

arXiv2017

The surface code with a twist

The surface code is one of the most successful approaches to topological quantum error-correction. It boasts the smallest known syndrome extraction circuits and correspondingly largest thresholds. Defect-based logical encodings of a new variety called twists have made it possible to implement the full Clifford group without state distillation. Here we investigate a patch-based encoding involving a modified twist. In our modified formulation, the resulting codes, called triangle codes for the shape of their planar layout, have only weight-four checks and relatively simple syndrome extraction circuits that maintain a high, near surface-code-level threshold. They also use 25% fewer physical qubits per logical qubit than the surface code. Moreover, benefiting from the twist, we can implement all Clifford gates by lattice surgery without the need for state distillation. By a surgical transformation to the surface code, we also develop a scheme of doing all Clifford gates on surface code patches in an atypical planar layout, though with less qubit efficiency than the triangle code. Finally, we remark that logical qubits encoded in triangle codes are naturally amenable to logical tomography, and the smallest triangle code can demonstrate high-pseudothreshold fault-tolerance to depolarizing noise using just 13 physical qubits.

quant-ph↗

arXiv2017

Holographic quantum simulation

A one-dimensional quantum simulator can simulate two-dimensional quantum many-body systems. A representation of a low-energy state is obtained by applying a feedback loop.

quant-ph↗

arXiv2017

Noise-resilient preparation of quantum many-body ground states

Certain quantum many-body ground states can be prepared by a large-depth quantum circuit consisting of geometrically local gates. In the presence of noise, local expectation values deviate from the correct value at most by an amount comparable to the noise rate. This happens if the action of the noiseless circuit, restricted to certain subsystems, rapidly mixes local observables up to a small correction. The encoding circuit for the surface code is given as an example.

quant-ph↗

arXiv2016

Markovian Marignals

We introduce a class of so called Markovian marginals, which gives a natural framework for constructing solutions to the quantum marginal problem. We consider a set of marginals that possess a certain internal quantum Markov chain structure. If they are equipped with such a structure and are locally consistent on their overlapping supports, there exists a global state that is consistent with all the marginals. The proof is constructive, and relies on a reduction of the marginal problem to a certain combinatorial problem. By employing an entanglement entropy scaling law, we give a physical argument that the requisite structure exists in any states with finite correlation lengths. This includes topologically ordered states as well as finite temperature Gibbs states.

quant-ph↗