In the past two decades, the field of quantum computing has developed rapidly, is gradually able to solve some difficult classical problems. With the development of the facilities for Noisy Intermediate-Scale Quantum(...
In the past two decades, the field of quantum computing has developed rapidly, is gradually able to solve some difficult classical problems. With the development of the facilities for Noisy Intermediate-Scale Quantum(NISQ), the NISQ technology addresses the existing Quantum programming languages or frameworks, suggesting that they cannot fully meet the requirements of Quantum computers. In recent years, some quantum programming languages or frameworks have emerged which claim to support the classical computing algorithms of heterogeneous quantum. However, the code is too cumbersome and redundant, and it is difficult to map the code to heterogeneous quantum classical computation while meeting the requirements of timing. Therefore, a modular programming framework of heterogeneous quantum classical computing algorithm with NISQ function is proposed. The framework optimizes the quantum code and retains the quantum classical interactions that satisfy the temporal constraints.
When a charged particle penetrates through an optical interface, photon emissions emerge—a phenomenon known as transition radiation. Being paramount to fundamental physics, transition radiation has enabled many appli...
详细信息
When a charged particle penetrates through an optical interface, photon emissions emerge—a phenomenon known as transition radiation. Being paramount to fundamental physics, transition radiation has enabled many applications from high-energy particle identification to novel light sources. A rule of thumb in transition radiation is that the radiation intensity generally decreases with the decrease of particle velocity v; as a result, low-energy particles are not favored in practice. Here, we find that there exist situations where transition radiation from particles with extremely low velocities (e.g., v/c<10−3) exhibits comparable intensity as that from high-energy particles (e.g., v/c=0.999), where c is the light speed in free space. The comparable radiation intensity implies an extremely high photon extraction efficiency from low-energy particles, up to 8 orders of magnitude larger than that from high-energy particles. This exotic phenomenon of low-velocity-favored transition radiation originates from the interference of the excited Ferrell-Berreman modes in an ultrathin epsilon-near-zero slab. Our findings may provide a promising route toward the design of integrated light sources based on low-energy electrons and specialized detectors for beyond-standard-model particles.
Quantum algorithms of factoring problem have been paid more and more attention since Shor's algorithm was proposed. Combining the current quantum computer hardware level and integer factorization quantum algorithm...
Quantum algorithms of factoring problem have been paid more and more attention since Shor's algorithm was proposed. Combining the current quantum computer hardware level and integer factorization quantum algorithms, this paper proposes a 'classical + quantum' hybrid solution. This scheme first adopts classical methods and corresponding rules in the preprocessing step to simplify the nonlinear equations, which is used to reduce the number of qubits needed for the cost Hamiltonian. Then the variational quantum algorithm is used to find the approximate ground state of the cost Hamiltonian, which encodes the solution of the nonlinear equations. The program was verified on the IBM QX4 quantum machine, and the results showed that this hybrid solution can effectively reduce the quantum resources required to solve the nonlinear equations.
The high efficiency of quantum algorithms is caused by the quantum parallelism of the superposition principle and the quantum entangled, but traditional quantum genetic algorithms only use the quantum superposition pr...
The high efficiency of quantum algorithms is caused by the quantum parallelism of the superposition principle and the quantum entangled, but traditional quantum genetic algorithms only use the quantum superposition principle. In order to further improve the performance of the algorithm, this paper proposes a new higher-order quantum genetic algorithm, which adds quantum entanglement properties on the basis of the principle of quantum superposition. Finally, the traditional quantum genetic algorithm and the higher-order quantum genetic algorithm are used to test a set of nonlinear equations many times. The results show that compared with the traditional quantum genetic algorithm, the evolutionary update operation of the higher-order quantum genetic algorithm does not involve multiple judgment conditions of the traditional quantum gate, requires less evolutionary algebra, and can converge quickly.
Knowledge graph inference has a wide range of applications in semantic search, question answering systems, entity disambiguation, link prediction, and recommendation systems. However, the accuracy and operational effi...
详细信息
The Internet of Things plays an increasingly important role in various fields. However, there are many devices in the Internet of Things that are unbalanced in terms of computing and storage capacity, which should be ...
详细信息
Event extraction is an important branch of information extraction. It involves two challenging issues: event identification and argument identification. Most approaches of event identification are trigger-based, which...
Event extraction is an important branch of information extraction. It involves two challenging issues: event identification and argument identification. Most approaches of event identification are trigger-based, which suffer a lot from sample imbalance, word ambiguity, low scalability, etc. To solve these problems, we attempt to explore sentence-based event identification, whose main issue is sentence representation. With the success of word embedding, it has attracted much attention to generate semantic embeddings of sentences. In this paper, we propose a simple BOW-based sentence embedding method to represent event sentences for Chinese event identification. We compute embeddings on the dependency tree and map different relations to simple arithmetic operations. We evaluate our method with a dataset of Chinese event identification and compare the result with other BOW-based methods. The results show that our approach significantly outperforms other BOW-based methods.
The supply of open source and open source components is growing at an alarming rate, while vulnerabilities in open source components are everywhere. Software supply chain analysis aims to discover third-party componen...
The supply of open source and open source components is growing at an alarming rate, while vulnerabilities in open source components are everywhere. Software supply chain analysis aims to discover third-party components and open source code used in a software, and analyze the software's dependence on components. In this paper, we propose a software component analysis method and a known vulnerabilities detecting method. By scanning the open source components of the binary file and conducting vulnerability analysis, the known vulnerabilities are detected. This paper mainly solves the problem of detecting known vulnerabilities in the supply chain of binary files. We conducted a case analysis and achieved good results.
Recursive relation mainly describes the unique law satisfied by a sequence, so it plays an important role in almost all branches of mathematics. It is also one of the main algorithms commonly used in computer programm...
Recursive relation mainly describes the unique law satisfied by a sequence, so it plays an important role in almost all branches of mathematics. It is also one of the main algorithms commonly used in computer programming. This paper first introduces the concept of recursive relation and two common basic forms, then starts with the solution of linear recursive relation with non-homogeneous constant coefficients, gives a new solution idea, and gives a general proof. Finally, through an example, the general method and the new method given in this paper are compared and verified.
Android dominates the mobile operating system market. Volatile memory analysis of Android devices has been the focus of research on mobile forensics technology. However, due to the semantic gap between the kernel and ...
Android dominates the mobile operating system market. Volatile memory analysis of Android devices has been the focus of research on mobile forensics technology. However, due to the semantic gap between the kernel and the volatile memory allocator, existing Android volatile memory analysis methods are coarse-grained. With the volatile memory capacity of Android devices increasing, these methods cannot satisfy the need of Android volatile memory analysis accuracy. In this paper, we first discuss the address space layout of Android processes and the management mechanism of Jemalloc, the default Android volatile memory allocator. Then, we bridge the semantic gap by utilizing the boundary auto alignment feature of the data structure of Jemalloc. Finally, we propose a Fine-grained Analysis Method for Android volatile Memory, called FAMAM. Experimental results shows that FAMAM has an accurate data analysis capability as well as a good robustness. In addition, we successfully use FAMAM to discover new storage patterns for username and password of Wechat.
暂无评论