We propose and fabricate an A1GaN/GaN high electron mobility transistor （HEMT） on sapphire substrate using a new kind of electron beam （EB） lithography layout for the T-gate. Using this new layout,we can change th...We propose and fabricate an A1GaN/GaN high electron mobility transistor （HEMT） on sapphire substrate using a new kind of electron beam （EB） lithography layout for the T-gate. Using this new layout,we can change the aspect ratio （ratio of top gate dimension to gate length） and modify the shape of the T-gate freely. Therefore, we obtain a 0.18μm gate-length AlGaN/GaN HEMT with a unity current gain cutoff frequency （fT） of 65GHz. The aspect ratio of the T-gate is 10. These single finger devices also exhibit a peak extrinsic transconductance of 287mS/mm and a maximum drain current as high as 980mA/mm.展开更多
In the stabilizer formalism of fault-tolerant quantum computation,stabilizer states serve as classical objects,while magic states(non-stabilizer states)are a kind of quantum resource(called magic resource)for promotin...In the stabilizer formalism of fault-tolerant quantum computation,stabilizer states serve as classical objects,while magic states(non-stabilizer states)are a kind of quantum resource(called magic resource)for promoting stabilizer circuits to universal quantum computation.In this framework,the T-gate is widely used as a non-Clifford gate which generates magic resource from stabilizer states.A natural question arises as whether the T-gate is in some sense optimal for generating magic resource.We address this issue by employing an intuitive and computable quantifier of magic based on characteristic functions(Weyl transforms)of quantum states.We demonstrate that the qubit T-gate,as well as its qutrit extension,the qutrit T-gate,are indeed optimal for generating magic resource among the class of diagonal unitary operators.Moreover,up to Clifford equivalence,the T-gate is essentially the only gate having such an optimal property.This reveals some intrinsic optimal features of the T-gate.We further compare the T-gate with general unitary gates for generating magic resource.展开更多
We connect magic(non-stabilizer)states,symmetric informationally complete positive operator valued measures(SIC-POVMs),and mutually unbiased bases(MUBs)in the context of group frames,and study their interplay.Magic st...We connect magic(non-stabilizer)states,symmetric informationally complete positive operator valued measures(SIC-POVMs),and mutually unbiased bases(MUBs)in the context of group frames,and study their interplay.Magic states are quantum resources in the stabilizer formalism of quantum computation.SIC-POVMs and MUBs are fundamental structures in quantum information theory with many applications in quantum foundations,quantum state tomography,and quantum cryptography,etc.In this work,we study group frames constructed from some prominent magic states,and further investigate their applications.Our method exploits the orbit of discrete Heisenberg-Weyl group acting on an initial fiducial state.We quantify the distance of the group frames from SIC-POVMs and MUBs,respectively.As a simple corollary,we reproduce a complete family of MUBs of any prime dimensional system by introducing the concept of MUB fiducial states,analogous to the well-known SIC-POVM fiducial states.We present an intuitive and direct construction of MUB fiducial states via quantum T-gates,and demonstrate that for the qubit system,there are twelve MUB fiducial states,which coincide with the H-type magic states.We compare MUB fiducial states and SIC-POVM fiducial states from the perspective of magic resource for stabilizer quantum computation.We further pose the challenging issue of identifying all MUB fiducial states in general dimensions.展开更多
It is obviously advantageous to use single-pattern cell ternary tree (T-gate)network to obtain ternary logic function. Many scholars at home and abroad have done much in minimization of T-gate realization of multiple-...It is obviously advantageous to use single-pattern cell ternary tree (T-gate)network to obtain ternary logic function. Many scholars at home and abroad have done much in minimization of T-gate realization of multiple-valued logic. It is generally acknowledged that it is necessary to try N! times in order to get an optimal result. However, using the Input Vector Map presented here, which is as simple and convenient as Binary Karnaugh Map, we can get an optimal result by trying only N times.展开更多
文摘We propose and fabricate an A1GaN/GaN high electron mobility transistor （HEMT） on sapphire substrate using a new kind of electron beam （EB） lithography layout for the T-gate. Using this new layout,we can change the aspect ratio （ratio of top gate dimension to gate length） and modify the shape of the T-gate freely. Therefore, we obtain a 0.18μm gate-length AlGaN/GaN HEMT with a unity current gain cutoff frequency （fT） of 65GHz. The aspect ratio of the T-gate is 10. These single finger devices also exhibit a peak extrinsic transconductance of 287mS/mm and a maximum drain current as high as 980mA/mm.
基金supported by the National Key R&D Program of China,Grant No.2020YFA0712700the National Natural Science Foundation of China,Grant No.11875317。
文摘In the stabilizer formalism of fault-tolerant quantum computation,stabilizer states serve as classical objects,while magic states(non-stabilizer states)are a kind of quantum resource(called magic resource)for promoting stabilizer circuits to universal quantum computation.In this framework,the T-gate is widely used as a non-Clifford gate which generates magic resource from stabilizer states.A natural question arises as whether the T-gate is in some sense optimal for generating magic resource.We address this issue by employing an intuitive and computable quantifier of magic based on characteristic functions(Weyl transforms)of quantum states.We demonstrate that the qubit T-gate,as well as its qutrit extension,the qutrit T-gate,are indeed optimal for generating magic resource among the class of diagonal unitary operators.Moreover,up to Clifford equivalence,the T-gate is essentially the only gate having such an optimal property.This reveals some intrinsic optimal features of the T-gate.We further compare the T-gate with general unitary gates for generating magic resource.
基金supported by the National Key R&D Program of China,Grant No.2020YFA0712700the National Natural Science Foundation of China‘Mathematical Basic Theory of Quantum Computing’special project,Grant No.12341103。
文摘We connect magic(non-stabilizer)states,symmetric informationally complete positive operator valued measures(SIC-POVMs),and mutually unbiased bases(MUBs)in the context of group frames,and study their interplay.Magic states are quantum resources in the stabilizer formalism of quantum computation.SIC-POVMs and MUBs are fundamental structures in quantum information theory with many applications in quantum foundations,quantum state tomography,and quantum cryptography,etc.In this work,we study group frames constructed from some prominent magic states,and further investigate their applications.Our method exploits the orbit of discrete Heisenberg-Weyl group acting on an initial fiducial state.We quantify the distance of the group frames from SIC-POVMs and MUBs,respectively.As a simple corollary,we reproduce a complete family of MUBs of any prime dimensional system by introducing the concept of MUB fiducial states,analogous to the well-known SIC-POVM fiducial states.We present an intuitive and direct construction of MUB fiducial states via quantum T-gates,and demonstrate that for the qubit system,there are twelve MUB fiducial states,which coincide with the H-type magic states.We compare MUB fiducial states and SIC-POVM fiducial states from the perspective of magic resource for stabilizer quantum computation.We further pose the challenging issue of identifying all MUB fiducial states in general dimensions.
文摘It is obviously advantageous to use single-pattern cell ternary tree (T-gate)network to obtain ternary logic function. Many scholars at home and abroad have done much in minimization of T-gate realization of multiple-valued logic. It is generally acknowledged that it is necessary to try N! times in order to get an optimal result. However, using the Input Vector Map presented here, which is as simple and convenient as Binary Karnaugh Map, we can get an optimal result by trying only N times.
