arXiv subjects
Publications and source records attributed to Biao Wu.
I show that the cloneability of information is the key difference between classical computer and quantum computer. As information stored and processed by neurons is cloneable, brain (human or non-human) is a classical computer. Penrose argued with the Gödel theorem that human brain is not classical. I demonstrate with an example why his argument is flawed. At the end, I discuss how to go beyond quantum computer.
A theoretical model of computation is proposed based on Lorentz quantum mechanics. Besides the standard qubits, this model has an additional bit, which we call hyperbolic bit (or hybit in short). A set of basic logical gates are constructed and their universality is proved. As an application, a search algorithm is designed for this computer model and is found to be exponentially faster than the Grover's search algorithm.
We present a quantum algorithm for approximating maximum independent sets of a graph based on quantum non-Abelian adiabatic mixing in the sub-Hilbert space of degenerate ground states, which generates quantum annealing in a secondary Hamiltonian. For both sparse and dense graphs, our quantum algorithm on average can find an independent set of size very close to $α(G)$, which is the size of the maximum independent set of a given graph $G$. Numerical results indicate that an $O(n^2)$ time complexity quantum algorithm is sufficient for finding an independent set of size $(1-ε)α(G)$. The best classical approximation algorithm can produce in polynomial time an independent set of size about half of $α(G)$.
We introduce the out-of-time-correlation(OTOC) with the Planck cell resolution. The dependence of this OTOC on the initial state makes it function like a microscope, allowing us to investigate the fine structure of quantum dynamics beyond the thermal state. We find an explicit relation of this OTOC to the spreading of the wave function in the Hilbert space, unifying two branches of the study of quantum chaos: state evolution and operator dynamics. By analyzing it in the vicinity of the classical limit, we clarify the dependence of the OTOC's exponential growth on the classical Lyapunov exponent.
This is a tutorial for the many-worlds theory by Everett, which includes some of my personal views. It has two main parts.The first main part shows the emergence of many worlds in a universe consisting of only a Mach-Zehnder interferometer. The second main part is an abridgment of Everett's long thesis, where his theory was originally elaborated in detail with clarity and rigor. Some minor comments are added in the abridgment in light of recent developments. Even if you do not agree to Everett's view, you will still learn a great deal from his generalization of the uncertainty relation, his unique way of defining entanglement (or canonical correlation), his formulation of quantum measurement using Hamiltonian, and his relative state.
We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability (Q2SAT) problem, which is a generalization of 2-satisfiability (2SAT) problem. For a Q2SAT problem, we construct the Hamiltonian which is similar to that of a Heisenberg chain. All the solutions of the given Q2SAT problem span the subspace of the degenerate ground states. The Hamiltonian is adiabatically evolved so that the system stays in the degenerate subspace. Our numerical results suggest that the time complexity of our algorithm is $O(n^{3.9})$ for yielding non-trivial solutions for problems with the number of clauses $m=dn(n-1)/2\ (d\lesssim 0.1)$. We discuss the advantages of our algorithm over the known quantum and classical algorithms.
We show that there is genuine quantum chaos despite that quantum dynamics is linear. This is revealed by introducing a physical distance between two quantum states. Qualitatively different from existing distances for quantum states, for example, the Fubini-Study distance, the physical distance between two mutually orthogonal quantum states can be very small. As a result, two quantum states, which are initially very close by physical distance, can diverge from each other during the ensuing quantum dynamical evolution. We are able to use physical distance to define quantum Lyaponov exponent and quantum chaos measure. The latter leads to quantum analogue of the classical Poincaré section, which maps out the regions where quantum dynamics is regular and the regions where quantum dynamics is chaotic. Three different systems, kicked rotor, three-site Bose-Hubbard model, and spin-1/2 XXZ model, are used to illustrate our results.
Scalable board games, including Five in a Row (or gomoku) and weiqi (or go), are generalized so that they can be played on or by quantum computers. We adopt three principles for the generalization: the first two are to ensure that the games are compatible with quantum computer and the third is to ensure that the standard classical games are the special cases. We demonstrate how to construct basic quantum moves and use them to set up quantum games. There are three different schemes to play the quantized games: one quantum computer with another quantum computer (QwQ), two classical computer playing with each other on one quantum computer (CQC), and one classical computer with another classical computer(CwC). We illustrate these results with the games of Five in a Row and weiqi.
We present an algorithm for the generalized search problem (searching $k$ marked items among $N$ items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity $O(\sqrt{N/k})$ as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary "monitor" qubits, can determine $k$ precisely, if it is unknown. The time complexity of our counting algorithm is $O(\sqrt{N})$, similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.
The effect of Kolmogorov-Arnold-Moser (KAM) theorem in quantum systems is manifested in dividing eigenstates into regular and irregular states. We propose an effective method based on Wannier basis in phase space to illustrate this division of eigenstates. The quantum kicked-rotor model is used to illustrate this method, which allows us to define the area and effective dimension of each eigenstate to distinguish quantitatively regular and irregular eigenstates. This Wannier basis method also allows us to define the length of a Planck cell in the spectrum that measures how many Planck cells the system will traverse if it starts at the given Planck cell. Moreover, with this Wannier approach, we are able to clarify the distinction between KAM effect and Anderson localization.
We present an efficient quantum algorithm for some independent set problems in graph theory, based on non-abelian adiabatic mixing. We illustrate the performance of our algorithm with analysis and numerical calculations for two different types of graphs, with the number of edges proportional to the number of vertices or its square. The theoretical advantages of our quantum algorithm over classical algorithms are discussed. Non-abelian adiabatic mixing can be a general technique to aid exploration in a landscape of near-degenerate ground states.
The monopole for the geometric curvature is studied for non-Hermitian systems. We find that the monopole contains not only the exceptional points but also branch cuts. As the mathematical choice of branch cut in the complex plane is rather arbitrary, the monopole changes with the branch-cut choice. Despite this branch-cut dependence, our monopole is invariant under the $GL(l,\mathbb{C})$ gauge transformation that is inherent in non-Hermitian systems. Although our results are generic, they are presented in the context of a two-mode non-Hermitian Dirac model. A corresponding two-mode Hermitian system is also discussed to illustrate the essential difference between monopoles in Hermitian systems and non-Hermitian systems.
For a fixed positive integer $n$ and an $r$-uniform hypergraph $H$, the Turán number $ex(n,H)$ is the maximum number of edges in an $H$-free $r$-uniform hypergraph on $n$ vertices, and the Lagrangian density of $H$ is defined as $π_λ(H)=\sup \{r! λ(G) : G \;\text{is an}\; H\text{-free} \;r\text{-uniform hypergraph}\}$, where $λ(G)$ is the Lagrangian of $G$. For an $r$-uniform hypergraph $H$ on $t$ vertices, it is clear that $π_λ(H)\ge r!λ{(K_{t-1}^r)}$. We say that an $r$-uniform hypergraph $H$ on $t$ vertices is perfect if $π_λ(H)= r!λ{(K_{t-1}^r)}$. Let $P_t=\{e_1, e_2, \dots, e_t\}$ be the linear $3$-uniform path of length $t$, that is, $|e_i|=3$, $|e_i \cap e_{i+1}|=1$ and $e_i \cap e_j=\emptyset$ if $|i-j|\ge 2$. We show that $P_3$ and $P_4$ are perfect, this supports a conjecture in \cite{yanpeng} proposing that all $3$-uniform linear hypergraphs are perfect. Applying the results on Lagrangian densities, we determine the Turán numbers of their extensions.
We propose a generalization of the quantum entropy introduced by Wigner and von Neumann in 1929 [Zeitschrift für Physik 57, 30 (1929)]. Our generalization is applicable to both quantum pure states and mixed states. When the dimension $N$ of the Hilbert space is large, as a result of typicality, this generalized Wigner-von Neumann (GWvN) entropy becomes independent of choices of basis and is asymptotically equal to $\ln N$. The dynamic evolution of our entropy is also typical, reminiscent of quantum H theorem proved by von Neumann. For the microcanonical ensemble, the GWvN entropy is equivalent to the Boltzmann entropy; for a subsystem in a mixed state, the GWvN entropy is equivalent to the familiar von Neumann entropy, which is zero for pure states. The GWvN entropy can be used to derive the Gibbs ensemble.
We discuss the basic theoretical framework for non-Hermitian quantum systems with particular emphasis on the diagonalizability of non-Hermitian Hamiltonians and their $GL(1,\mathbb{C})$ gauge freedom, which are relevant to the adiabatic evolution of non-Hermitian quantum systems. We find that the adiabatic evolution is possible only when the eigen-energies are real. The accompanying geometric phase is found to be generally complex and associated with not only the phase of a wavefunction but also its amplitude. The condition for the real geometric phase is laid out. Our results are illustrated with two examples of non-Hermitian $\mathcal{PT}$ symmetric systems, the two-dimensional non-Hermitian Dirac fermion model and bosonic Bogoliubov quasi-particles.
We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of $L$ gates we can construct a quantum adiabatic algorithm with time complexity of $O(L)$. Additionally, our construction shows that one may exponentially speed up some quantum adiabatic algorithms by properly choosing an evolution path.
We find that the quantum-classical correspondence in integrable systems is characterized by two time scales. One is the Ehrenfest time below which the system is classical; the other is the quantum revival time beyond which the system is fully quantum. In between, the quantum system can be well approximated by classical ensemble distribution in phase space. These results can be summarized in a diagram which we call Ehrenfest diagram. We derive an analytical expression for Ehrenfest time, which is proportional to $\hbar^{-1/2}$. According to our formula, the Ehrenfest time for the solar-earth system is about $10^{26}$ times of the age of the solar system.We also find an analytical expression for the quantum revival time, which is proportional to $\hbar^{-1}$. Both time scales involve $ω(I)$, the classical frequency as a function of classical action. Our results are numerically illustrated with two simple integrable models. In addition, we show that similar results exist for Bose gases, where $1/N$ serves as an effective Planck constant.
We study systematically the period-doubled Bloch states for a weakly interacting Bose-Einstein condensate in a one-dimensional optical lattice. This kind of state is of form $ψ_k=e^{ikx}ϕ_k(x)$, where $ϕ_k(x)$ is of period twice the optical lattice constant. Our numerical results show how these nonlinear period-doubled states grow out of linear period-doubled states at a quarter away from the Brillouin zone center as the repulsive interatomic interaction increases. This is corroborated by our analytical results. We find that all nonlinear period-doubled Bloch states have both Landau instability and dynamical instability.