相关论文: Universal Quantum Gates For Tensors
It is shown that there exists a mapping between the fermions of the Standard Model (SM) represented as braids in the Bilson-Thompson model, and a set of gates which can perform Universal Quantum Computation (UQC). This leads us to…
We propose an encoding for topological quantum computation utilizing quantum representations of mapping class groups. Leakage into a non-computational subspace seems to be unavoidable for universality in general. We are interested in the…
Most modern classical processors support so-called von Neumann architecture with program and data registers. In present work is revisited similar approach to models of quantum processors. Deterministic programmable quantum gate arrays are…
We introduce a novel framework for Generalized Tensor Transforms (GTTs), constructed through an $n$-fold tensor product of an arbitrary $b \times b$ unitary matrix $W$. This construction generalizes many established transforms, by providing…
A series of geometric concepts are formulated for $\mathcal{PT}$-symmetric quantum mechanics and they are further unified into one entity, i.e., an extended quantum geometric tensor (QGT). The imaginary part of the extended QGT gives a…
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an…
Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…
We demonstrate a quadratic phase gate for one-way quantum computation in the continuous-variable regime. This canonical gate, together with phase-space displacements and Fourier rotations, completes the set of universal gates for realizing…
We investigate the tomography of unknown unitary quantum processes within the framework of a finite-dimensional Wigner-type representation. This representation provides a rich visualization of quantum operators by depicting them as shapes…
To guarantee the normal functioning of quantum devices in different scenarios, appropriate benchmarking tool kits are quite significant. Inspired by the recent progress on quantum state verification, here we establish a general framework of…
We introduce a constructive procedure that maps all spatial correlations of a broad class of states into temporal correlations between general quantum measurements. This allows us to present temporal phenomena analogous to genuinely…
We develop and analyze a method for simulating quantum circuits on classical computers by representing quantum states as rooted tree tensor networks. Our algorithm first determines a suitable, fixed tree structure adapted to the expected…
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates…
We show that single-qudit universality in Clifford-based gate sets follows a trichotomy determined by the prime factorization of the local dimension $d$. For prime $d$, any gate outside the Clifford group is universal. For prime-power…
This paper explores of the role of unitary braiding operators in quantum computing. We show that a single specific solution R (the Bell basis change matrix) of the Yang-Baxter Equation is a universal gate for quantum computing, in the…
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a…
We present the time-dependent Quantum Geometric Tensor (tQGT) as a comprehensive tool for capturing the geometric character of insulators observable within linear response. We show that tQGT describes the zero-point motion of bound…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
We present a quantum solver for partial differential equations based on a flexible matrix product operator representation. Utilizing mid-circuit measurements and a state-dependent norm correction, this scheme overcomes the restriction of…
As the most central and computationally intensive component of deep neural networks, the execution efficiency of matrix multiplication directly determines the training and inference performance of models. Harnessing the parallel processing…