This paper presents a method for gaze estimation according to face images. We train several gaze estimators adopting four different network architectures, including an architecture designed for gaze estimation (i.e.,iTracker-MHSA) and three originall
y designed for general computer vision tasks(i.e., BoTNet, HRNet, ResNeSt). Then, we select the best six estimators and ensemble their predictions through a linear combination. The method ranks the first on the leader-board of ETH-XGaze Competition, achieving an average angular error of $3.11^{circ}$ on the ETH-XGaze test set.
This paper is a brief introduction to our submission to the seven basic expression classification track of Affective Behavior Analysis in-the-wild Competition held in conjunction with the IEEE International Conference on Automatic Face and Gesture Re
cognition (FG) 2020. Our method combines Deep Residual Network (ResNet) and Bidirectional Long Short-Term Memory Network (BLSTM), achieving 64.3% accuracy and 43.4% final metric on the validation set.
We discuss a method to construct quantum codes correcting amplitude damping errors via code concatenation. The inner codes are chosen as asymmetric Calderbank-Shor-Steane (CSS) codes. By concatenating with outer codes correcting symmetric errors, man
y new codes with good parameters are found, which are better than the amplitude damping codes obtained by any previously known construction.
We discuss a method to adapt the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. We focus on the corresponding Pauli error models for amplitude damping noise and phase damping noise. In particular,
we look at codes for Pauli error models that correct one or two amplitude damping errors. Applying local Clifford operations on graph states, we are able to exhaustively search for all possible codes up to length $9$. With a similar method, we also look at codes for the Pauli error model that detect a single amplitude error and detect multiple phase damping errors. Many new codes with good parameters are found, including nonadditive codes and degenerate codes.
Topologically ordered systems exhibit large-scale correlation in their ground states, which may be characterized by quantities such as topological entanglement entropy. We propose that the concept of irreducible many-body correlation, the correlation
that cannot be implied by all local correlations, may also be used as a signature of topological order. In a topologically ordered system, we demonstrate that for a part of the system with holes, the reduced density matrix exhibits irreducible many-body correlation which becomes reducible when the holes are removed. The appearance of these irreducible correlations then represents a key feature of topological phase. We analyze the many-body correlation structures in the ground state of the toric code model in an external magnetic field, and show that the topological phase transition is signaled by the irreducible many-body correlations.
Traditional quantum physics solves ground states for a given Hamiltonian, while quantum information science asks for the existence and construction of certain Hamiltonians for given ground states. In practical situations, one would be mainly interest
ed in local Hamiltonians with certain interaction patterns, such as nearest neighbour interactions on some type of lattices. A necessary condition for a space $V$ to be the ground-state space of some local Hamiltonian with a given interaction pattern, is that the maximally mixed state supported on $V$ is uniquely determined by its reduced density matrices associated with the given pattern, based on the principle of maximum entropy. However, it is unclear whether this condition is in general also sufficient. We examine the situations for the existence of such a local Hamiltonian to have $V$ satisfying the necessary condition mentioned above as its ground-state space, by linking to faces of the convex body of the local reduced states. We further discuss some methods for constructing the corresponding local Hamiltonians with given interaction patterns, mainly from physical points of view, including constructions related to perturbation methods, local frustration-free Hamiltonians, as well as thermodynamical ensembles.
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 groun
d 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.
One-way quantum computation proceeds by sequentially measuring individual spins (qubits) in an entangled many-spin resource state. It remains a challenge, however, to efficiently produce such resource states. Is it possible to reduce the task of gene
rating these states to simply cooling a quantum many-body system to its ground state? Cluster states, the canonical resource for one-way quantum computing, do not naturally occur as ground states of physical systems. This led to a significant effort to identify alternative resource states that appear as ground states in spin lattices. An appealing candidate is a valence-bond-solid state described by Affleck, Kennedy, Lieb, and Tasaki (AKLT). It is the unique, gapped ground state for a two-body Hamiltonian on a spin-1 chain, and can be used as a resource for one-way quantum computing. Here, we experimentally generate a photonic AKLT state and use it to implement single-qubit quantum logic gates.
