Low Energy Theorem for SUSY Breaking with Gauge Supermultiplets

Low energy theorems of Nambu-Goldstone fermion associated with spontaneously broken supersymmetry are studied for gauge supermultiplets. Two possible terms in the effective Lagrangian are needed to deal with massless gaugino and/or massless gauge boson. As an illustrative example, a concrete model is worked out which can interpolate massless as well as massive gaugino and/or gauge boson to examine the low energy effective interaction of NG-fermion.Comment: 14page

Application of tensor network method to two dimensional lattice N=1\mathcal{N}=1 Wess-Zumino model

We study a tensor network formulation of the two dimensional lattice $\mathcal{N}=1$ Wess-Zumino model with Wilson derivatives for both fermions and bosons. The tensor renormalization group allows us to compute the partition function without the sign problem, and basic ideas to obtain a tensor network for both fermion and scalar boson systems were already given in previous works. In addition to improving the methods, we have constructed a tensor network representation of the model including the Yukawa-type interaction of Majorana fermions and real scalar bosons. We present some numerical results.Comment: 8 pages, 4 figures, talk presented at the 35th International Symposium on Lattice Field Theory (Lattice 2017), 18-24 June 2017, Granada, Spai

Two-level Quantum Walkers on Directed Graphs II: An Application to qRAM

This is the second paper in a series of two. Using a multi-particle continuous-time quantum walk with two internal states, which has been formulated in the first paper (arXiv:2112.08119), we physically implement a quantum random access memory (qRAM). Data with address information are dual-rail encoded into quantum walkers. The walkers pass through perfect binary trees to access the designated memory cells and copy the data stored in the cells. A roundabout gate allocated at each node serves as a router to move the walker from the parent node to one of two child nodes, depending on the internal state of the walker. In this process, the address information is sequentially encoded into the internal states so that the walkers are adequately delivered to the target cells. The present qRAM, which processes $2^n$ $m$-qubit data, is implemented in a quantum circuit of depth $O(n\log(n+m))$ and requires $O(n+m)$ qubit resources. This is more efficient than the conventional bucket-brigade qRAM that requires $O(n^2+nm)$ steps and $O(2^{n}+m)$ qubit resources for processing. Moreover, since the walkers are not entangled with any device on the binary trees, the cost of maintaining coherence could be reduced. Notably, by simply passing quantum walkers through binary trees, data can be automatically extracted in a quantum superposition state. In other words, any time-dependent control is not required.Comment: 23 pages. This is the second paper in a series of two. The first paper is arXiv:2112.0811