Abstract: Gauge invariance is one of the more important concepts in physics. We discuss this concept in connection with the unitary evolution of discrete-time quantum walks in one and two spatial dimensions, when they include the interaction with synthetic, external electromagnetic fields. One introduces this interaction as additional phases that play the role of gauge fields. Here, we present a way to incorporate those phases, which differs from previous works. Our proposal allows the discrete derivatives, that appear under a gauge transformation, to treat time and space on the same footing, in a way which is similar to standard lattice gauge theories. By considering two steps of the evolution, we define a density current which is gauge invariant and conserved. In the continuum limit, the dynamics of the particle, under a suitable choice of the parameters, becomes the Dirac equation and the conserved current satisfies the corresponding conservation equation.

Abstract: The aim of this paper is to build quantum circuits that implement discrete-time quantum walks having an arbitrary position-dependent coin operator. The position of the walker is encoded in base 2: with n wires, each corresponding to one qubit, we encode 2(n) position states. The data necessary to define an arbitrary position-dependent coin operator is therefore exponential in n. Hence, the exponentiality will necessarily appear somewhere in our circuits. We first propose a circuit implementing the position-dependent coin operator, that is naive, in the sense that it has exponential depth and implements sequentially all appropriate position-dependent coin operators. We then propose a circuit that “transfers” all the depth into ancillae, yielding a final depth that is linear in n at the cost of an exponential number of ancillae. Themain idea of this linear-depth circuit is to implement in parallel all coin operators at the different positions. Reducing the depth exponentially at the cost of having an exponential number of ancillae is a goal which has already been achieved for the problem of loading classical data on a quantum circuit (Araujo in Sci Rep 11:6329, 2021) (notice that such a circuit can be used to load the initial state of the walker). Here, we achieve this goal for the problem of applying a position-dependent coin operator in a discrete-time quantum walk. Finally, we extend the result of Welch (New J Phys 16:033040, 2014) from position-dependent unitaries which are diagonal in the position basis to position-dependent 2 x 2-block-diagonal unitaries: indeed, we show that for a position dependence of the coin operator (the block-diagonal unitary) which is smooth enough, one can find an efficient quantum-circuit implementation approximating the coin operator up to an error epsilon (in terms of the spectral norm), the depth and size of which scale as O(1/epsilon). A typical application of the efficient implementation would be the quantum simulation of a relativistic spin-1/2 particle on a lattice, coupled to a smooth external gauge field; notice that recently, quantum spatial-search schemes have been developed which use gauge fields as the oracle, to mark the vertex to be found (Zylberman in Entropy 23:1441, 2021), (Fredon arXiv:2210.13920). A typical application of the linear-depth circuit would be when there is spatial noise on the coin operator (and hence a non-smooth dependence in the position).

Abstract: I consider the interaction of a small quantum system (a qubit) with a structured environment consisting of many levels. The qubit will experience a decoherence process, which implies that part of its initial information will be encoded into correlations between system and environment. I investigate how this information is distributed on a given subset of levels as a function of its size, using the mutual information between both entities, in the spirit of the partial-information plots studied by Zurek and co-workers. In this case we can observe some differences, which arise from the fact that I am partitioning just one quantum system and not a collection of them. However, some similar features, like redundancy (in the sense that a given amount of information is shared by many subsets), which increases with the size of the environment, are also found here.