Fermi Velocity Reduction of Dirac Fermions around the Brillouin Zone Center in In2 Se3 -Bilayer Graphene Heterostructures.

Emergent phenomena such as unconventional superconductivity, Mott-like insulators, and the peculiar quantum Hall effect in graphene-based heterostructures are proposed to stem from the superlattice-induced renormalization of (moiré) Dirac fermions at the graphene Brillouin zone corners. Understanding the corresponding band structure commonly demands photoemission spectroscopy with both sub-meV resolution and large-momentum coverage, beyond the capability of the current state-of-the-art. Here the realization of moiré Dirac cones around the Brillouin zone center in monolayer In2 Se3 /bilayer graphene heterostructure is reported. The renormalization is evidenced by reduced Fermi velocity (≈23%) of the moiré Dirac cones and the reshaped Dirac point at the Γ point where they intersect. While there have been many theoretical predictions and much indirect experimental evidence, the findings here are the first direct observation of Fermi velocity reduction of the moiré Dirac cones. These features suggest strong In2 Se3 /graphene interlayer coupling, which is comparable with that in twisted bilayer graphene. The strategy expands the choice of materials in the heterostructure design and stimulates subsequent broad investigations of emergent physics at the sub-meV energy scale.

Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor.

Applications of quantum walks can depend on the number, exchange symmetry and indistinguishability of the particles involved, and the underlying graph structures where they move. Here, we show that silicon photonics, by exploiting an entanglement-driven scheme, can realize quantum walks with full control over all these properties in one device. The device we realize implements entangled two-photon quantum walks on any five-vertex graph, with continuously tunable particle exchange symmetry and indistinguishability. We show how this simulates single-particle walks on larger graphs, with size and geometry controlled by tuning the properties of the composite quantum walkers. We apply the device to quantum walk algorithms for searching vertices in graphs and testing for graph isomorphisms. In doing so, we implement up to 100 sampled time steps of quantum walk evolution on each of 292 different graphs. This opens the way to large-scale, programmable quantum walk processors for classically intractable applications.