Gennady P. Berman, Gary D. Doolen, Gustavo V. López, V. I. Tsifrinovich
The physical implementation of the quantum Control-Not gate for a two-spin system is investigated numerically. The concept of a generalized quantum Control-Not gate, with arbitrary phase shift, is introduced. It is shown that a resonant $π$-pulse provides a simple example of a generalized quantum Control-Not gate.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
I describe the use of techniques based on composite rotations to develop controlled phase gates in which the effects of weak Ising couplings are suppressed. A tailored composite phase gate is described which both suppresses weak couplings and is relatively insensitive to systematic errors in the size of strong couplings.
I describe the use of techniques based on composite rotations to combat systematic errors in controlled phase gates, which form the basis of two qubit quantum logic gates. Although developed and described within the context of Nuclear Magnetic Resonanace (NMR) quantum computing these sequences should be applicable to any implementation of quantum computation based on Ising couplings. In combination with existing single qubit gates this provides a universal set of robust quantum logic gates.
We exactly construct one- and two-qubit holonomic quantum gates in terms of isospectral deformations of an Ising model Hamiltonian. A single logical qubit is constructed out of two spin-1/2 particles; the qubit is a dimer. We find that the holonomic gates obtained are discrete but dense in the unitary group. Therefore an approximate gate for a desired one can be constructed with arbitrary accuracy.
We construct a minimal robust controlled-NOT gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed with the minimal number (N=3) of elementary two-qubit gates and several one-qubit gates. It is noteworthy that all the robust circuits can be mapped to one-qubit circuits robust against a pulse length error. We also prove that a minimal robust SWAP gate cannot be constructed with N=3, but requires N=6 elementary two-qubit gates.
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating classical computer gates. As for optical as well as magnetic systems, those gates are obtained as quantum evolutions. Despite, in certain cases they are attained as an asymptotic series of evolution effects. The current work exploits the direct sum of the evolution operator on a non-local basis for the driven bipartite Heisenberg-Ising model to construct a set o…
We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising interaction between the neighboring spins. The selective excitations of the spins are provided by the gradient of the external magnetic field. The protocols are built of rectangular radio-frequency pulses. The phase and probability errors caused by unwanted transitions are minimized and computed numerically.
Here we describe a simple mechanical procedure for compiling a quantum gate network into the natural gates (pulses and delays) for an Ising quantum computer. The aim is not necessarily to generate the most efficient pulse sequence, but rather to develop an efficient compilation algorithm that can be easily implemented in large spin systems. The key observation is that it is not always necessary to refocus all the undesired couplings in a spin system. Instead the coupling evolution can simply be tracked and then corrected at some later time. Although described within the language of NMR the alg…
We consider the model of quantum computer, which is represented as a Ising spin lattice, where qubits (spin-half systems) are separated by the isolators (two spin-half systems). In the idle mode or at the single bit operations the total spin of isolators is 0. There are no need of complicated protocols for correcting the phase and probability errors due to permanent interaction between the qubits. We present protocols for implementation of universal quantum gates with the rectangular radio-frequency pulses.
High-Fidelity Universal Quantum Gate Compilation for Non-semisimple Ising Anyons via Genetic Algorithm-Optimized Solovay-Kitaev Decomposition
本研究通过遗传算法优化的Solovay-Kitaev分解，实现了非半单伊辛任何子的高保真通用量子门编译，构建了{H,T,CNOT}通用门集，显著提高了双量子比特门的保真度。
Quantum computation is a continuously growing research area which is based on nature and resources of quantum mechanics, as superposition and entanglement. In its quantum circuits version, the use of convenient and appropriate gates is essential. But while those gates adopt convenient forms for computational algorithms, their design depends on specific quantum systems and stu? being used. These gates need manage quantum systems based on physical interactions ruled by quantum Hamiltonians. With this, gates design is restricted to properties and limitations of interactions and physical elements …
It is imperative to compile quantum circuits for Noisy Intermediate-Scale Quantum (NISQ) devices because of the limited connectivity of physical qubits and the high error rates of gate operations. One of the most critical steps in quantum circuit compilation is qubit routing, an NP-Hard problem that involves placing and moving logical qubits to minimize compilation overhead. In this study, we propose ISing mAchine Assisted Quantum compiler (ISAAQ) to perform qubit routing with Ising machines, which can efficiently solve Quadratic Unconstrained Binary Optimization (QUBO) problems. ISAAQ accurat…
We analytically determine the minimal time and the optimal control laws required for the realization, up to an assigned fidelity and with a fixed energy available, of entangling quantum gates ($\mathrm{CNOT}$) between indirectly coupled qubits of a trilinear Ising chain. The control is coherent and open loop, and it is represented by a local and continuous magnetic field acting on the intermediate qubit. The time cost of this local quantum operation is not restricted to be zero. When the matching with the target gate is perfect (fidelity equal to one) we provide exact solutions for the case of…
We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n \geq 3 qubits we prove that the the image of the braid group is a non-trivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We als…
Ising-type non-Abelian anyons are likely to occur in a number of physical systems, including quantum Hall systems, where recent experiments support their existence. In general, non-Abelian anyons may be utilized to provide a topologically error-protected medium for quantum information processing. However, the topologically protected operations that may be obtained by braiding and measuring topological charge of Ising anyons are precisely the Clifford gates, which are not computationally universal. The Clifford gate set can be made universal by supplementing it with single-qubit pi/8-phase gate…
We propose a Lyapunov control design to achieve specific (or a family of) unitary time-evolution operators, i.e., quantum gates in the Schrödinger picture by tracking control. Two examples are presented. In the first, we illustrate how to realize the Hadamard gate in a single-qubit system, while in the second, the controlled-NOT (CNOT) gate is implemented in two-qubit systems with the Ising and Heisenberg interactions. Furthermore, we demonstrate that the control can drive the time-evolution operator into the local equivalence class of the CNOT gate and the operator keeps in this class forever…
We propose a simplified mathematical construction of the quantum Fourier transform which is suited for systems described by Ising-type Hamiltonians. By contrast to the standard Cooley-Tuckey scheme, which prescribes sequences of CPHASE gates, our implementation is based on one-qubit gates and a free evolution process. We also show how to obtain a quadratic speed-up by applying the conditional interactions simultaneously. Thus rather than O($N^2$) our implementation time scales as O($N$). Finally, we show a realization of our method with homogeneous microwave driven ion traps in a magnetic fiel…
Recent proposals using heterostructures of superconducting and either topologically insulating or semiconducting layers have been put forth as possible platforms for topological quantum computation. These systems are predicted to contain Ising anyons and share the feature of having only neutral edge excitations. In this note, we show that these proposals can be combined with the recently proposed "sack geometry" for implementation of a phase gate in order to conduct robust universal quantum computation. In addition, we propose a general method for adjusting edge tunneling rates in such systems…
Conditional multi-qubit gates are a key component for elaborate quantum algorithms. In a recent work, Rasmussen et al. (Phys. Rev. A 101, 022308) proposed an efficient single-step method for a prototypical multi-qubit gate, a Toffoli gate, based on a combination of Ising interactions between control qubits and an appropriate driving field on a target qubit. Trapped ions are a natural platform to implement this method, since Ising interactions mediated by phonons have been demonstrated in increasingly large ion crystals. However, the simultaneous application of these interactions and the drivin…
The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an Ising-spin quantum computer. Our results are an important step toward effective modeling of the quantum modular adder which is needed for Shor's and other quantum algorithms. Our full adder has the following features: (i) The near-resonant transitions with small detunings are completely suppressed, which allows us to decrease errors by several orders of magnitu…
Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian
本文提出在采用横场伊辛哈密顿量的传统量子退火架构中，通过绝热变换使基态简并来实现通用量子计算，方案兼容D-Wave设备，为大规模可扩展量子计算平台开辟了新路径。
One of the major problems of most quantum computing applications is that the required number of qubits to solve a practical problem is much larger than that of today's quantum hardware. We propose an algorithm, called large-system sampling approximation (LSSA), to solve Ising problems with sizes up to $N_{\rm{gb}}2^{N_{\rm{gb}}}$ by an $N_{\rm{gb}}$-qubit gate-based quantum computer, and with sizes up to $N_{\rm{an}}2^{N_{\rm{gb}}}$ by a hybrid computational architecture of an $N_{\rm{an}}$-qubit quantum annealer and an $N_{\rm{gb}}$-qubit gate-based quantum computer. By dividing the full-syst…
We describe how a universal set of dynamically-corrected quantum gates can be implemented using sequences of shaped decoupling pulses on any qubit network forming a sparse bipartite graph with always-on Ising interactions. These interactions are constantly decoupled except when they are needed for two-qubit gates. We analytically study the error operators associated with the constructed gates up to third order in the Magnus expansion, analyze these errors numerically in the unitary time evolution of small qubit clusters, and give a bound on high-order errors for qubits on a large square lattic…
The ferromagnetic state of an Ising chain can represent a two-fold degenerate subspace or equivalently a logical qubit which is protected from excitations by an energy gap. We study a a braiding-like exchange operation through the movement of the state in the qubit subspace which resembles that of the localized edge modes in a Kitaev chain. The system consists of two Ising chains in a 1D geometry where the operation is simulated through the adiabatic time evolution of the ground state. The time evolution is implemented via the Suzuki-Trotter expansion on basic single- and two-qubit quantum gat…
What is the time-optimal way of realizing quantum operations? Here, we show how important instances of this problem can be related to the study of shortest paths on the surface of a sphere under a special metric. Specifically, we provide an efficient synthesis of a controlled NOT (CNOT) gate between qubits coupled indirectly via Ising-type couplings to a third spin. Our implementation of the CNOT gate is more than twice as fast as conventional approaches. The pulse sequences for efficient manipulation of our coupled spin system are obtained by explicit computation of geodesics on a sphere unde…
We formulate binary optimization functions for single-vehicle routing, travelling salesperson and collision-free multi-vehicle routing with significant improvements in the number of variables over existing formulations. The provided functions are readily implemented on gate-based quantum computers using variational algorithms and on adiabatic quantum hardware.
Optimally mapping a parallel application to compute and communication resources is increasingly important as both system size and heterogeneity increase. A similar mapping problem exists in gate-based quantum computing where the objective is to map tasks to gates in a topology-aware fashion. This is an NP-complete graph isomorphism problem, and existing task assignment approaches are either heuristic or based on physical optimization algorithms, providing different speed and solution quality trade-offs. Ising machines such as quantum and digital annealers have recently become available and off…
The SWAP gate plays a central role in network designs for qubit quantum computation. However, there is a view to generalize qubit quantum computing to higher dimensional quantum systems. In this paper we construct a generalized SWAP gate using only instances of the generalized controlled-NOT gate to cyclically permute the states of $d$ qudits for $d$ prime.
An approach to the construction of the CNOT quantum logic gate for a 4-dimensional coupled-qubit model with weak but otherwise arbitrary coupling has been given recently [M. R. Geller et al., Phys. Rev. A, 012320 (2010)]. How does the resulting fidelity depend on the form of qubit-qubit coupling? In this paper we calculate intrinsic fidelity curves (fidelity in the absence of decoherence versus total gate time) for a variety of qubit-qubit interactions, including the commonly occurring isotropic Heisenberg and XY models, as well as randomly generated ones. For interactions not too close to tha…
Deep Ising Born Machine
针对量子神经网络效率与普适性矛盾的问题，提出深度伊辛玻恩机（DIBoM），通过广义受控Z门等架构实现两者的平衡，并引入基于保真度的表达能力度量验证其高效与普适性。
Error suppression by a virtual two-qubit gate
本研究提出利用虚拟双量子比特门（VTQG）抑制超导量子计算机中SWAP门引入的误差，通过减少SWAP门数量并结合脉冲高效编译，在8量子比特横场伊辛模型模拟中实现一个数量级的精度提升。
We report numerical results on the diagonalization of 1D transverse field Ising model. Numerical simulations using the Pauli product representation yield diagonalization from 3 spins to 22 spins in the transverse field Ising model with the number of global Jacobi unitary transformations and number of final terms in diagonalized spin z representation both grew polynomial with the number of spins. These results computed on a classical computer show promise in constructing a quantum circuit to simulate diagonalized generic many-particle Hamiltonians using polynomial number of gates.
The Lieb-Robinson theorem states that the speed at which the correlations between two distant nodes in a spin network can be built through local interactions has an upper bound, which is called the Lieb-Robinson velocity. Our central aim is to demonstrate how to observe the Lieb-Robinson velocity in an Ising spin chain with a strong transverse field. We adopt and compare four correlation measures for characterizing different types of correlations, which include correlation function, mutual information, quantum discord, and entanglement of formation. We prove that one of correlation functions s…
Polynomial equivalence of the global transverse-field Ising model and the gate model of quantum computation
本文证明非单调时变全局横向场伊辛模型可在多项式时间内模拟任意量子电路，从而建立其与门模型的等价性，并推导出经典模拟的不可行性。
Robust shaped pulses for arrays of superconducting or semiconductor spin qubits with fixed Ising coupling
针对固态量子比特阵列扩展中耦合控制布线复杂的问题，提出基于固定Ising耦合量子比特阵列的鲁棒通用门方案，可适配现有超导与半导体自旋量子比特阵列结构。
A generalization of the quantum XOR-gate is presented which operates in arbitrary dimensional Hilbert spaces. Together with one-particle Fourier transforms this gate is capable of performing a variety of tasks which are important for quantum information processing in arbitrary dimensional Hilbert spaces. Among these tasks are the preparation of Bell states, quantum teleportation and quantum state purification. A physical realization of this generalized XOR-gate is proposed which is based on non-linear optical elements.
It is shown that certain natural quantum logic gates, {\it i.e.} unitary time evolution matrices for spin-\frac{1}{2} quantum spins, can be represented as sums, with appropriate phases, over classical logic gates, in a direct analogy with the Feynman path integral representation of quantum mechanics. On the other hand, it is shown that a natural quantum gate obtained by analytically continuing the transfer matrix of the anisotropic nearest-neighbour Ising model to imaginary time, does not admit such a representation.
Possibly, teleportation is the most representative quantum algorithm in the public domain. Nevertheless than this quantum procedure transmits only information than objects, its coverage is still very limited and easily subject to errors. Based on a fine control of quantum resources, particularly those entangled, the research to extend its coverage and flexibility is open, in particular on matter based quantum systems. This work shows how anisotropic Ising interactions could be used as natural basis for this procedure, based on a sequence of magnetic pulses driving Ising interaction, stating re…
Control of quantum entanglement has been considered as elemental physical resource for quantum applications in Quantum Information and Quantum Computation. Control of entangled states on a couple of atoms, ions or quantum dots are milestones in almost all quantum applications towards a scalable spin-based quantum computers or quantum devices. For magnetic systems, Ising model is an interaction which generates and modifies entanglement properties of quantum systems based on matter. In addition, when this interaction includes driven magnetic fields, it can be controlled to sustain, characterize …
We investigate numerically a single-pulse implementation of a quantum Control-Not (CN) gate for an ensemble of Ising spin systems at room temperature. For an ensemble of four-spin ``molecules'' we simulate the time-evolution of the density matrix, for both digital and superpositional initial conditions. Our numerical calculations confirm the feasibility of implementation of quantum CN gate in this system at finite temperature, using electromagnetic $π$-pulse.
In [R. Jozsa, B. Kraus, A. Miyake, J. Watrous, Proc. R. Soc. A {\bf 466}, 809-830 (2010)] it has been shown that a match gate circuit running on n qubits can be compressed to a universal quantum computation on \log(n)+3 qubits. Here, we show how this compression can be employed to simulate the Ising interaction of a 1D--chain consisting out of n qubits using a universal quantum computer running on log(n) qubits. We demonstrate how the adiabatic evolution can be realized on this exponentially smaller system and how the magnetization, which shows a quantum phase transition, can be measured.
The problem of finding efficient decompositions of multi-qubit gates is of importance for quantum computing, especially, in application to existing noisy intermediate-scale quantum devices, whose resources are substantially limited. Here we propose a decomposition scheme for a generalized $N$-qubit Toffoli gate with the use of $2N-3$ two-qutrit gates for arbitrary connectivity. The fixed number of the required additional levels (the choice of qutrits is optimal) and the use of the iSWAP gate as a native operation make our approach directly applicable for ongoing experiments with superconductin…
A SAT approach to the initial mapping problem in SWAP gate insertion for commuting gates
针对量子电路中可交换门的初始映射难题，提出一种基于 SAT 的方法及结合聚类算法的启发式方法，显著减少了交换门数量与层数，使大规模量子算法在含噪硬件上的研究成为可能。
We present an approximate analytical solution to the dynamic equation of two Ising-coupled qubits with oscillating classical control fields that are nonperpendicular to the static drift fields. This is a situation that has recently arisen in some solid-state experiments. With our solution we derive the analytical expressions for the local invariants as well as the local rotations needed to isolate a purely nonlocal gate. This determines the set of parameters that are required to generate any entangling gate. Moreover, we use our results to describe a recent experimental work on capacitively co…
Synthesis of and compilation with time-optimal multi-qubit gates
本文针对全连接固定 Ising 型相互作用平台，提出时间最优纠缠多量子比特门合成方法，并据此给出 Clifford 电路、QFT、分子模拟及对角酉编译策略。
We give analytical solutions for the time-optimal synthesis of entangling gates between indirectly coupled qubits 1 and 3 in a linear spin chain of three qubits subject to an Ising Hamiltonian interaction with equal coupling $J$ plus a local magnetic field acting on the intermediate qubit. The energy available is fixed, but we relax the standard assumption of instantaneous unitary operations acting on single qubits. The time required for performing an entangling gate which is equivalent, modulo local unitary operations, to the $\mathrm{CNOT}(1, 3)$ between the indirectly coupled qubits 1 and 3…
A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into statistically independent reservoirs. The proposed universal quantum gates are constructed with the help of Heisenberg- and Ising-type Hamiltonians acting on these physical qubits. This way it is guaranteed that the relevant error correcting code space is not left at any time even during the application of one of these quantum gates. The proposed entanglement gate is…
Permutation-Invariant Quantum Codes with Transversal Generalized Phase Gates
本研究针对量子码横向门群问题，构造可横向实现广义相位门的置换不变自旋码，证明非加性码性能优于稳定子码，且所提T门实现方案在量子比特数和最小距离上更具优势。
We present quantum networks for a n-qubit controlled gate C^{n-1}(U) which use a higher dimensional (qudit) ancilla as a catalyser. In its simplest form the network has only n two-particle gates (qubit-qudit) -- this is the minimum number of two-body interactions needed to couple all n+1 subsystems (n qubits plus one ancilla). This class of controlled gates includes the generalised Toffoli gate C^{n-1}(X) on n qubits, which plays an important role in several quantum algorithms and error correction. A particular example implementing this model is given by the dispersive limit of a generalised J…
Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems
该研究提出一种硬件高效变分优化拟设，将门排序作为变分参数，在50比特超导处理器上实验验证了含数千门的稠密Ising优化电路性能优于随机猜测，为量子优化的硬件利用提供启示。
We explicitly derive a connection between quantum circuits utilising IBM's quantum gate set and multivariate quadratic polynomials over integers modulo 8. We demonstrate that the action of a quantum circuit over input qubits can be written as generalized Walsh-Hadamard transform. Here, we derive the polynomials corresponding to implementations of the Swap gate and Toffoli gate using IBM-Q gate set.
Emergence of Strategic Equilibria from Transverse Field Ising Hamiltonian Dynamics
该研究基于横向场伊辛哈密顿量动力学，提出算子形式的量子博弈研究方法，通过可调纠缠算子解决博弈困境，获得优于经典结果的量子优势，为量子博弈设计提供硬件相关视角。
We establish a general map between Grassmann functionals for fermions and probability or weight distributions for Ising spins. The equivalence between the two formulations is based on identical transfer matrices and expectation values of products of observables. The map preserves locality properties and can be realized for arbitrary dimensions. We present a simple example where a quantum field theory for free massless Dirac fermions in two-dimensional Minkowski space is represented by an asymmetric Ising model on a euclidean square lattice.
We exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The proof uses an expression for the Ising model partition function in terms of quadratically signed weight enumerators (QWGTs), which are polynomials that arise naturally in an expansion of quantum circuits in terms of rotations involving Pauli matrices. We combine this expression with a known efficient classical algorithm for the Ising partition function of any planar graph in the absence of an external …
We have embedded two fixed-frequency Al/AlO$_{\textrm{x}}$/Al transmons, with ground-to-excited transition frequencies at 6.0714 GHz and 6.7543 GHz, in a single 3D Al cavity with a fundamental mode at 7.7463 GHz. Strong coupling between the cavity and each transmon results in an effective qubit-qubit coupling strength of 26 MHz and a -1 MHz dispersive shift in each qubit's transition frequency, depending on the state of the other qubit. Using the all-microwave SWIPHT (Speeding up Waveforms by Inducing Phases to Harmful Transitions) technique, we demonstrate the operation of a generalized contr…
Generalized cross-resonance scheme for maximally-entangling two-qutrit gates
本文提出了一种通用交叉共振方案，用于实现最大纠缠的两量子三能级门，并通过模拟展示了多个纠缠门实例及高保真度实验结果。
We present the study of a quantum Controlled-Controlled-Not gate, implemented in a chain of three nuclear spins weakly Ising interacting between all of them, that is, taking into account first and second neighbor spin interactions. This implementation is done using a single resonant $π$-pulse on the initial state of the system (digital and superposition). The fidelity parameter is used to determine the behavior of the CCN quantum gate as a function of the ratio of the second neighbor interaction coupling constant to the first neighbor interaction coupling constant ($J'/J$). We found that for $…
We study the simulation of a single qubit rotation and Controlled-Not gate in a solid state one-dimensional chain of nuclear spins system interacting weakly through an Ising type of interaction with a modular component of the magnetic field in the z-direction, characterized by $B_z(z,t)=Bo(z)\cosδt$. These qubits are subjected to electromagnetic pulses which determine the transition in the one or two qubits system. We use the fidelity parameter to determine the performance of the Not (N) gate and Controlled-Not (CNOT) gate as a function of the frequency parameter $δ$. We found that for $|δ|\le…
Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and Clifford operators can be applied fault-tolerantly. Indeed, this technique can be generalized for an extended set of gates, the so called ${\mathcal{C}}_k$ hierarchy gates, introduced by Gottesman and Chuang (Nature, 402, 390-392). ${\mathcal{C}}_k$ gates are a generalization of Clifford operators, but our knowledge of these sets is not as rich as our knowledge of…
Quantum Rare-Event Estimation for Ising Graphical Models with Belief-Propagation State Preparation
本研究针对伊辛图模型的量子稀有事件估计难题，结合循环信念传播与Chow-Liu算法制备态，构建结构预言机，经二十节点供应链模型验证，量子估计器误差低于经典蒙特卡罗基线。
Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g. (artificial) atoms or ions, admit encoding of more complex multilevel states -- qudits. Recently, significant attention is paid to the idea of using qudit encoding as a way for further scaling quantum processors. In this work, we present an efficient decomposition of the generalized Toffoli gate on the five-level quantum systems, so-called ququints, that uses ququints' space as the space of two qubits with a joi…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。