arXiv subjects

Zhaohui Wei

Publications and source records attributed to Zhaohui Wei.

51 records · Page 3Linked to original sources

arXiv2011

Ground-State Spaces of Frustration-Free Hamiltonians

We study the ground-state space properties for frustration-free Hamiltonians. We introduce a concept of `reduced spaces' to characterize local structures of ground-state spaces. For a many-body system, we characterize mathematical structures for the set $Θ_k$ of all the $k$-particle reduced spaces, which with a binary operation called join forms a semilattice that can be interpreted as an abstract convex structure. The smallest nonzero elements in $Θ_k$, called atoms, are analogs of extreme points. We study the properties of atoms in $Θ_k$ and discuss its relationship with ground states of $k$-local frustration-free Hamiltonians. For spin-1/2 systems, we show that all the atoms in $Θ_2$ are unique ground states of some 2-local frustration-free Hamiltonians. Moreover, we show that the elements in $Θ_k$ may not be the join of atoms, indicating a richer structure for $Θ_k$ beyond the convex structure. Our study of $Θ_k$ deepens the understanding of ground-state space properties for frustration-free Hamiltonians, from a new angle of reduced spaces.

quant-ph↗

arXiv2011

Measurement-Based Quantum Computing with Valence-Bond-Solids

Measurement-based quantum computing (MBQC) is a model of quantum computing that proceeds by sequential measurements of individual spins in an entangled resource state. However, it remains a challenge to produce efficiently such resource states. Would it be possible to generate these states by simply cooling a quantum many-body system to its ground state? Cluster states, the canonical resource states for MBQC, do not occur naturally as unique ground states of physical systems. This inherent hurdle has led to a significant effort to identify alternative resource states that appear as ground states in spin lattices. Recently, some interesting candidates have been identified with various valence-bond-solid (VBS) states. In this review, we provide a pedagogical introduction to recent progress regarding MBQC with VBS states as possible resource states. This study has led to an interesting interdisciplinary research area at the interface of quantum information science and condensed matter physics.

quant-ph↗

arXiv2011

Correlations in excited states of local Hamiltonians

Physical properties of the ground and excited states of a $k$-local Hamiltonian are largely determined by the $k$-particle reduced density matrices ($k$-RDMs), or simply the $k$-matrix for fermionic systems---they are at least enough for the calculation of the ground state and excited state energies. Moreover, for a non-degenerate ground state of a $k$-local Hamiltonian, even the state itself is completely determined by its $k$-RDMs, and therefore contains no genuine ${>}k$-particle correlations, as they can be inferred from $k$-particle correlation functions. It is natural to ask whether a similar result holds for non-degenerate excited states. In fact, for fermionic systems, it has been conjectured that any non-degenerate excited state of a 2-local Hamiltonian is simultaneously a unique ground state of another 2-local Hamiltonian, hence is uniquely determined by its 2-matrix. And a weaker version of this conjecture states that any non-degenerate excited state of a 2-local Hamiltonian is uniquely determined by its 2-matrix among all the pure $n$-particle states. We construct explicit counterexamples to show that both conjectures are false. It means that correlations in excited states of local Hamiltonians could be dramatically different from those in ground states. We further show that any non-degenerate excited state of a $k$-local Hamiltonian is a unique ground state of another $2k$-local Hamiltonian, hence is uniquely determined by its $2k$-RDMs (or $2k$-matrix).

quant-ph↗

arXiv2011

On characterizing quantum correlated equilibria

Quantum game theory lays a foundation for understanding the interaction of people using quantum computers with conflicting interests. Recently Zhang proposed a simple yet rich model to study quantum strategic games, and addressed some quantitative questions for general games of growing sizes \cite{Zha10}. However, one fundamental question that the paper did not consider is the characterization of quantum correlated equilibria (QCE). In this paper, we answer this question by giving a sufficient and necessary condition for an arbitrary state $ρ$ being a QCE. In addition, when the condition fails to hold for some player $i$, we give an explicit POVM for that player to achieve a strictly positive gain. Finally, we give some upper bounds for the maximum gain by playing quantum strategies over classical ones, and the bounds are tight for some games.

quant-ph↗

arXiv2010

Complete Characterization of the Ground Space Structure of Two-Body Frustration-Free Hamiltonians for Qubits

The problem of finding the ground state of a frustration-free Hamiltonian carrying only two-body interactions between qubits is known to be solvable in polynomial time. It is also shown recently that, for any such Hamiltonian, there is always a ground state that is a product of single- or two-qubit states. However, it remains unclear whether the whole ground space is of any succinct structure. Here, we give a complete characterization of the ground space of any two-body frustration-free Hamiltonian of qubits. Namely, it is a span of tree tensor network states of the same tree structure. This characterization allows us to show that the problem of determining the ground state degeneracy is as hard as, but no harder than, its classical analog.

quant-ph↗

arXiv2010

Majorization in Quantum Adiabatic Algorithms

The majorization theory has been applied to analyze the mathematical structure of quantum algorithms. An empirical conclusion by numerical simulations obtained in the previous literature indicates that step-by-step majorization seems to appear universally in quantum adiabatic algorithms. In this paper, a rigorous analysis of the majorization arrow in a special class of quantum adiabatic algorithms is carried out. In particular, we prove that for any adiabatic algorithm of this class, step-by-step majorization of the ground state holds exactly. For the actual state, we show that step-by-step majorization holds approximately, and furthermore that the longer the running time of the algorithm, the better the approximation.

quant-ph↗

arXiv2010

Quantum Capacity Approaching Codes for the Detected-Jump Channel

The quantum channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known. Given the quantum capacity of a degradable channel, it remains challenging to find a practical coding scheme which approaches capacity. Here we discuss code designs for the detected-jump channel, a degradable channel with practical relevance describing the physics of spontaneous decay of atoms with detected photon emission. We show that this channel can be used to simulate a binary classical channel with both erasures and bit-flips. The capacity of the simulated classical channel gives a lower bound on the quantum capacity of the detected-jump channel. When the jump probability is small, it almost equals the quantum capacity. Hence using a classical capacity approaching code for the simulated classical channel yields a quantum code which approaches the quantum capacity of the detected-jump channel.

quant-ph↗

arXiv2009

Adiabatic Quantum Counting by Geometric Phase Estimation

We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $α$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a Berry phase $2πα$. By estimating the Berry phase, we can approximate $α$, and solve the problem. For an error bound $ε$, the algorithm can solve the problem with cost of order $(\frac{1}ε)^{3/2}$, which is not as good as the optimal algorithm in the quantum circuit model, but better than the classical random algorithm. Moreover, since the Berry phase is a purely geometric feature, the result may be robust to decoherence and resilient to certain noise.

quant-ph↗

arXiv2008

Efficient One-way Quantum Computations for Quantum Error Correction

We show how to explicitly construct an $O(nd)$ size and constant quantum depth circuit which encodes any given $n$-qubit stabilizer code with $d$ generators. Our construction is derived using the graphic description for stabilizer codes and the one-way quantum computation model. Our result demonstrates how to use cluster states as scalable resources for many multi-qubit entangled states and how to use the one-way quantum computation model to improve design of quantum algorithms.

quant-ph↗

arXiv2008

The LU-LC conjecture is false

The LU-LC conjecture is an important open problem concerning the structure of entanglement of states described in the stabilizer formalism. It states that two local unitary equivalent stabilizer states are also local Clifford equivalent. If this conjecture were true, the local equivalence of stabilizer states would be extremely easy to characterize. Unfortunately, however, based on the recent progress made by Gross and Van den Nest, we find that the conjecture is false.

quant-ph↗

arXiv2007

Linearity and Quantum Adiabatic Theorem

We show that in a quantum adiabatic evolution, even though the adiabatic approximation is valid, the total phase of the final state indicated by the adiabatic theorem may evidently differ from the actual total phase. This invalidates the application of the linearity and the adiabatic approximation simultaneously. Besides, based on this observation we point out the mistake in the traditional proof for the adiabatic theorem. This mistake is the root of the troubles that the adiabatic theorem has met. We also show that a similar mistake remains in some recent modifications of the traditional adiabatic theorem attempting to eliminate the troubles.

quant-ph↗

arXiv2006

Quantum adiabatic evolutions that can't be used to design efficient algorithms

Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic evolution with a interpolation path is too simple, the minimal gap between the ground state and the first excited state of this quantum adiabatic evolution is an inverse exponential distance. Thus quantum adiabatic evolutions of this kind can't be used to design efficient quantum algorithms. Similarly, we show that a quantum adiabatic evolution with a simple final hamiltonian also has a long running time, which suggests that some functions can't be minimized efficiently by any quantum adiabatic evolution with a interpolation path.

quant-ph↗

arXiv2005

A modified quantum adiabatic evolution for the Deutsch-Jozsa problem

Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic speed up over classical algorithms. We show that a modified version of the adiabatic evolution in that paper can improve the performance to constant time.

quant-ph↗

arXiv2005

A relation between fidelity and quantum adiabatic evolution

Recently, some quantum algorithms have been implemented by quantum adiabatic evolutions. In this paper, we discuss the accurate relation between the running time and the distance of the initial state and the final state of a kind of quantum adiabatic evolutions. We show that this relation can be generalized to the case of mixed states.

quant-ph↗

arXiv2004

Quantum search algorithm by adiabatic evolution under a priori probability

Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum algorithms, including Grover's algorithm. In this paper, we show that quantum search algorithm by adiabatic evolution has two properties that conventional quantum search algorithm doesn't have. Firstly, we show that in the initial state of the algorithm only the amplitude of the basis state corresponding to the solution affects the running time of the algorithm, while other amplitudes do not. Using this property, if we know a priori probability about the location of the solution before search, we can modify the adiabatic evolution to make the algorithm faster. Secondly, we show that by a factor for the initial and finial Hamiltonians we can reduce the running time of the algorithm arbitrarily. Especially, we can reduce the running time of adiabatic search algorithm to a constant time independent of the size of the database. The second property can be extended to other adiabatic algorithms.

quant-ph↗