quantum devices offer a highly useful function - that is generating random numbers in a non-deterministic way since the measurement of a quantum state is not deterministic. This means that quantum devices can be const...
详细信息
quantum devices offer a highly useful function - that is generating random numbers in a non-deterministic way since the measurement of a quantum state is not deterministic. This means that quantum devices can be constructed that generate qubits in a uniform superposition and then measure the state of those qubits. If the preparation of the qubits in a uniform superposition is unbiased, then quantum computers can be used to create high entropy, secure random numbers. Typically, preparing and measuring such quantum systems requires more time compared to classical pseudo random number generators (PRNGs) which are inherently deterministic algorithms. Therefore, the typical use of quantum random number generators (QRNGs) is to provide high entropy secure seeds for PRNGs. quantum annealing (QA) is a type of analog quantum computation that is a relaxed form of adiabatic quantum computation and uses quantum fluctuations in order to search for ground state solutions of a programmable Ising model. Here we present extensive experimental random number results from a D-Wave 2000Q quantum annealer, totaling over 20 billion bits of QA measurements, which is significantly larger than previous D-Wave QA random number generator studies. Current quantum annealers are susceptible to noise from environmental sources and calibration errors, and are not in general unbiased samplers. Therefore, it is of interest to quantify whether noisy quantum annealers can effectively function as an unbiased QRNG. The amount of data that was collected from the quantum annealer allows a comprehensive analysis of the random bits to be performed using the NIST SP 800-22 Rev 1a testsuite, as well as min-entropy estimates from NIST SP 800-90B. The randomness tests show that the generated random bits from the D-Wave 2000Q are biased, and not unpredictable random bit sequences. With no server-side sampling post-processing, the 1 microsecond annealing time measurements had a min-entropy of 0.824.
The advancement of Rydberg atoms in quantuminformation technology is driving a paradigm shift from classical radio-frequency (RF) receivers to Rydberg atomic receivers. Capitalizing on the extreme sensitivity of Rydb...
详细信息
The advancement of Rydberg atoms in quantuminformation technology is driving a paradigm shift from classical radio-frequency (RF) receivers to Rydberg atomic receivers. Capitalizing on the extreme sensitivity of Rydberg atoms to external electromagnetic fields, Rydberg atomic receivers are capable of realizing more precise radio-wave measurements than RF receivers to support high-performance wireless communication and sensing. Although the atomic receiver is developing rapidly in quantum-physics domain, its integration with wireless communications is at a nascent stage. In particular, systematic methods to enhance communication performance through this integration are yet to be discovered. Motivated by this observation, we propose in this paper to incorporate Rydberg atomic receivers into multiple-input-multiple-output (MIMO) communication, a prominent 5G technology, as the first attempt on implementing atomic MIMO receivers. To begin with, we provide a comprehensive introduction on the principles of Rydberg atomic receivers and build on them to design the atomic MIMO receivers. Our findings reveal that signal detection of atomic MIMO receivers corresponds to a non-linear biased phase retrieval (PR) problem, as opposed to the linear Gaussian model adopted in classical MIMO systems. Then, to recover signals from this non-linear model, we modify the Gerchberg-Saxton (GS) algorithm, a typical PR solver, into a biased GS algorithm to solve the biased PR problem. Moreover, we propose a novel Expectation-Maximization GS (EM-GS) algorithm to cope with the unique Rician distribution of the biased PR model. Our EM-GS algorithm introduces a high-pass filter constructed by the ratio of Bessel functions into the iteration procedure of GS, thereby improving the detection accuracy without sacrificing the computational efficiency. Finally, the effectiveness of the devised algorithms and the feasibility of atomic MIMO receivers are demonstrated by theoretical analysis and numerica
We introduce a new model in quantum machine learning (QML) that combines the strengths of existing quantum kernel SVM (QK-SVM) and quantum variational SVM (QV-SVM) methods. Our proposed model, quantum variational kern...
详细信息
We introduce a new model in quantum machine learning (QML) that combines the strengths of existing quantum kernel SVM (QK-SVM) and quantum variational SVM (QV-SVM) methods. Our proposed model, quantum variational kernel SVM (QVK-SVM), utilizes quantum kernel and quantum variational algorithms to improve accuracy in QML applications. In this paper, we conduct extensive experiments on the Iris dataset to evaluate the performance of QVK-SVM against QK-SVM and QV-SVM models. Our results demonstrate that QVK-SVM outperforms both existing models regarding accuracy, loss, and confusion matrix indicators. We believe that QVK-SVM can be a reliable and transformative tool for QML applications and recommend its use in future QML research.
The phase-matching quantum key distribution (PM-QKD) protocol has been widely researched since it was proposed. In this paper, the performance of asymmetric PM-QKD protocol is discussed and the efforts of statistical ...
详细信息
The phase-matching quantum key distribution (PM-QKD) protocol has been widely researched since it was proposed. In this paper, the performance of asymmetric PM-QKD protocol is discussed and the efforts of statistical fluctuation and source error on asymmetric PM-QKD protocol are analyzed through numerical simulations. In the case of limited data sets, system parameters need to be optimized to increase the key rate. However, traditional exhaustive traversal or local search algorithms cannot meet the time requirement of real-time communication. With the development of machine learning, using machine learning for parameter optimization has been widely applied in various disciplines. This paper uses recurrent neural network (RNN) to predict the optimization parameters of asymmetric PM-QKD. The results show that RNN can quickly and accurately predict optimization parameters, which can provide a reference for future real-time QKD networks.
With the development of noisy intermediate-scale quantum machines, quantum processors show their supremacy in specific applications. To better understand the quantum behavior and verify larger quantum bit (qubit) algo...
详细信息
With the development of noisy intermediate-scale quantum machines, quantum processors show their supremacy in specific applications. To better understand the quantum behavior and verify larger quantum bit (qubit) algorithms, simulation on classical computers becomes crucial. However, as the simulated number of qubits increases, the full-state simulation suffers exponential memory increment for state vector storing. In order to compress the state vector, some existing works reduce the memory by data encoding compressors. Nevertheless, the memory requirement remains massive. Meanwhile, others utilize compact decision diagrams (DD) to represent the state vector, which only demands linear memory size. However, the existing DD-based simulation algorithm possesses many redundant calculations that require further exploration. Besides, the traditional normalization-based nodes merging method of DD amplifies the side influences of approximate error. Therefore, to tackle the above challenges, in this paper, we first fully explore the redundancies in the recursive-based DD simulation (RecurSim) algorithm. Inspired by the regularities of the quantum circuit model, a scale-based simulation (ScaleSim) algorithm is proposed, which removes plenty of unnecessary computations. Furthermore, to eliminate the influences of approximate error, we propose a new pre-check DD building method, namely PCB, which maintains the accuracy of DD representation and produces more memory saving. Comprehensive experiments show that our method achieves up to 24124.2x acceleration and 3.2x10(7)x memory reduction than traditional DD-based methods on quantumalgorithms while maintaining the representation accuracy.
In this paper, we present an efficient quantum algorithm to simulate nonlinear differential equations with polynomial vector fields of arbitrary (finite) degree on quantum platforms. Ordinary differential equations (O...
详细信息
In this paper, we present an efficient quantum algorithm to simulate nonlinear differential equations with polynomial vector fields of arbitrary (finite) degree on quantum platforms. Ordinary differential equations (ODEs) and partial differential equations (PDEs) arise extensively in science and engineering applications. Examples of ODE models include mechanics of rigid bodies, molecular dynamics, chemical kinetics, and epidemiology. Nonlinear PDEs arise in fluid dynamics, combustion, weather forecasting, structural mechanics, plasma dynamics, and finance to name a few. In practice, it is challenging to simulate such equations on classical computers due to high dimensionality, stiffness arising from multiple spatial/temporal scales, nonlinearities, and chaotic dynamics. Typically, high performance computing is used to mitigate computational challenges and involves approximations for tractability. For sparse n-dimensional linear ODEs, quantumalgorithms have been developed which can produce a quantum state proportional to the solution in poly(log(n))\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {poly}(\log (n))$$\end{document}) time using the quantum linear systems algorithm (QLSA). Recently, this framework was extended to systems of nonlinear ODEs with quadratic polynomial vector fields by applying Carleman linearization that enables the embedding of the quadratic system into an approximate linear form. A detailed complexity analysis was conducted which showed significant computational advantage under certain conditions. We present an extension of this algorithm to deal with systems of nonlinear ODEs with k-th degree polynomial vector fields for arbitrary (finite) values of k. The steps involve: (1) mapping the k-th degree polynomial ODE to a higher-dimensional quadratic polyno
quantum neural networks (QNNs) integrate the advantages of quantuminformation with the formidable capabilities of classical neural networks, exhibiting notable potential in image classification tasks. However, the pe...
详细信息
The improved flexible representation of a quantum image (IFRQI) employs an effective method to encode grayscale image information in a normalized quantum state vector, which allows for accurate retrieval of image info...
详细信息
The improved flexible representation of a quantum image (IFRQI) employs an effective method to encode grayscale image information in a normalized quantum state vector, which allows for accurate retrieval of image information through projective measurements. In this paper, we propose a high-capacity and robust steganography algorithm based on the IFRQI model. We embed the grayscale information of a 2(n) x2(n) sized secret image in a 2(n+1) x2(n+1) sized cover image using controlled rotations. The secret image is divided into four image planes, each with a bit depth of 2. For each image plane, an array of angle values encoding the 2-bit color information is prepared. The encoded information is then embedded in the IFRQI state of the cover image using controlled rotations determined by the key K, which is only known to the operator. The secret image extraction algorithm is the inverse process of the embedding algorithm, which requires the inverse key K '. Analyses of the embedding capacity, time complexity, and visual effects reveal that the proposed steganography algorithm is comparable with some state-of-the-art algorithms.
An innovative additive manufacturing process called laser melting deposition (LMD) has many benefits for precisely generating complex structures. However, process optimization, defect detection and quality control are...
详细信息
An innovative additive manufacturing process called laser melting deposition (LMD) has many benefits for precisely generating complex structures. However, process optimization, defect detection and quality control are difficulties that LMD faces despite its potential. The manual inspection and traditional algorithms used in traditional defect identification and quality control procedures are time-consuming, computationally costly and prone to errors in high-dimensional datasets. This research examines the integration of defect detection and quality control methods in LMD production. information from various sensors, including optical, laser, pressure and temperature sensors, are used to track the LMD process. To guarantee consistency and correctness in the dataset, the initial stage entails pre-processing the gathered data using cleaning and min-max normalization techniques. Feature extraction is performed using Principal Component Analysis (PCA), which lowers the data's dimensionality while keeping the crucial details required for a successful analysis. An approach called Dynamic Artificial Rabbits optimized quantum support vector machine (DARO-QSVM) is used to identify quality control parameters and identify flaws in the LMD process;the suggested methodology seeks to increase the accuracy (95.36%) of defect detection, and optimize process parameters in real-time. This study demonstrates how high-dimensional data problems and the dynamic, nonlinear character of LMD could be resolved with quantum-based technologies, providing a viable way forward for improvements in manufacturing quality control in the future.
Introducing elements of quantuminformation and computation in the secondary school curriculum is a trend which has very recently emerged in physics education. In this paper we describe a tentative elementarization sc...
详细信息
Introducing elements of quantuminformation and computation in the secondary school curriculum is a trend which has very recently emerged in physics education. In this paper we describe a tentative elementarization scheme for the informationprocessing phase of quantumalgorithms, and report on a preliminary evaluation of its feasibility on Italian selfselected secondary school students in distance learning. While the test was conducted on a very small sample in special conditions, this work of clarification promoted a consistent understanding of the algorithmic structure in informational terms and, at least partially, in physical ones. The feasibility test had for us a positive outcome, which led to refinements of the approach and further tests, also on curricular teaching, which were performed from 2022 onwards.
暂无评论