EPJ Quantum Technology最新文献

Quantum architecture Search (QAS) is a promising direction for optimization and automated design of quantum circuits towards quantum advantage. Recent techniques in QAS emphasize Multi-Layer Perceptron (MLP)-based deep Q-networks. However, their interpretability remains challenging due to the large number of learnable parameters and the complexities involved in selecting appropriate activation functions. In this work, to overcome these challenges, we utilize the Kolmogorov-Arnold Network (KAN) in the QAS algorithm, analyzing their efficiency in the task of quantum state preparation and quantum chemistry. In quantum state preparation, our results show that in a noiseless scenario, the probability of success is 2× to 5× higher than MLPs. In noisy environments, KAN outperforms MLPs in fidelity when approximating these states, showcasing its robustness against noise. In tackling quantum chemistry problems, we enhance the recently proposed QAS algorithm by integrating curriculum reinforcement learning with a KAN structure. This facilitates a more efficient design of parameterized quantum circuits by reducing the number of required 2-qubit gates and circuit depth. Further investigation reveals that KAN requires a significantly smaller number of learnable parameters compared to MLPs; however, the average time of executing each episode for KAN is higher.

Research and curriculum development on quantum information science is a novel but technologically and socially significant challenge for physics education. While the debate is open on the core content, the approaches, and the strategies for addressing the need of effective instruction on the subject-matter, some indications have begun to emerge. Among them, the importance of an earlier start of education and of helping students develop not only a theoretical knowledge, but also high-level experimental skills including ideal design and conduction of experiments. Such skills are challenging to attain in existing traditional programs and may be considered inaccessible at introductory level because of the difficulties connected with qubit implementations. Here we present the design process, the structure, and a preliminary evaluation of a course for secondary school that is aimed to promote the building of a basic but integrated understanding of quantum information science, including experimental design and lab activities. The course was developed within the model of educational reconstruction, and embedded into a conceptual change framework in physics and computation. The encoding of polarization and which-path information of a photon is used to engage students in the development of a global model of logical encoding and processing, in ideal experimental design of gates and circuits, and in their implementation on the optical bench. Data show the effectiveness of the course in promoting student engagement in the modelling of gates in different encodings, in fostering an understanding of the computational role of physical setups, and a positive attitude and interest towards quantum computation and innovative teaching methods.

Hexagonal boron nitride exhibits two types of defects with great potential for quantum information technologies: single-photon emitters (SPEs) and one-dimensional grain boundaries hosting topologically-protected phonons, termed as topologically-protected phonon lines (TPL). Here, by means of a simple effective model and density functional theory calculations, we show that it is possible to use these phonons for the transmission of information. Particularly, a single SPE can be used to induce single-, two- and qubit-phonon states in the one-dimensional channel, and (ii) two distant SPEs can be coupled by the TPL that acts as a waveguide, thus exhibiting strong quantum correlations. We highlight the possibilities offered by this material-built-in nano-architecture as a phononic device for quantum information technologies.

Material discovery is a phenomenon practiced since the evolution of the world. The discovery of materials has led to significant development in varied fields such as Science, Engineering and Technology. Computationally simulating molecules has been an area of interest in the industry as well as academia. However, simulating large molecules can be computationally expensive in terms of computing power and complexity. Quantum computing is a recent development that can improve the efficiency in predicting properties of atoms and molecules which will be useful for material design. The Variational Quantum Eigensolver (VQE) is one such quantum algorithm used to calculate the ground state energy of molecules or ions. In this study, we have done a comparative analysis of the parameters that constitute the VQE algorithm. This includes components such as basis, qubit mapping, ansatz, and optimizers used. We have also developed a database consisting of 79 single atoms and their variations of oxidation states and 33 molecules with the data of their Hamiltonian and ground state energy and dipole moment.

This study explores the integration of quantum data embedding techniques into classical machine learning (ML) algorithms; to assess performance enhancements and computational implications across a spectrum of models. We explored various classical-to-quantum mapping methods; ranging from basis encoding and angle encoding to amplitude encoding; for encoding classical data. We conducted an extensive empirical study encompassing popular ML algorithms, including Logistic Regression, K-Nearest Neighbors, Support Vector Machines, and ensemble methods like Random Forest, LightGBM, AdaBoost, and CatBoost. Our findings reveal that quantum data embedding contributes to improved classification accuracy and F1 scores, particularly notable in models that inherently benefit from enhanced feature representation. We observed nuanced effects on running time, with low-complexity models exhibiting moderate increases and more computationally intensive models experiencing discernible changes. Notably, ensemble methods demonstrated a favorable balance between performance gains and computational overhead.

This study underscores the potential of quantum data embedding to enhance classical ML models and emphasizes the importance of weighing performance improvements against computational costs. Future research may involve refining quantum encoding processes to optimize computational efficiency and explore scalability for real-world applications. Our work contributes to the growing body of knowledge on the intersection of quantum computing and classical machine learning, offering insights for researchers and practitioners seeking to harness the advantages of quantum-inspired techniques in practical scenarios.

Quantum algorithms have demonstrated extraordinary potential across numerous fields, offering significant advantages in solving practical problems. Power Quality Disturbances (PQDs) have always been a critical factor affecting the stability and safety of electrical power systems, and accurately detecting and identifying PQDs is crucial for ensuring reliable system operation. This paper explores the application of quantum algorithms in the field of power quality and proposes a novel method using Quantum Support Vector Machines (QSVM) to detect and identify PQDs, which marks the first application of QSVM in PQD analysis. The QSVM model employed involves three main stages: quantum feature mapping, quantum kernel computation, and model training. Quantum feature mapping uses quantum circuits to map classical data into a high-dimensional Hilbert space, enhancing feature separability. Quantum kernel computation calculates the inner products between features for model training. Rigorous theoretical and experimental analyses validate our approach. This method achieves a time complexity of (O(N^{2} log (N))), superior to classical SVM algorithms. Simulation results show high accuracy in PQDs detection, achieving a 100% detection rate and a 96.25% accuracy rate in single PQD identification. Experimental outcomes demonstrate robustness, maintaining over 87% accuracy even with increased noise levels, confirming its effectiveness in PQDs detection and identification.

Currently, access to quantum processors is costly in terms of time, and power. There are quantum simulators and emulators on the market that offer alternatives for evaluating the behavior of a real quantum processor. However, these emulation environments present accuracy deviations from real devices, mainly because of difficult-to-model error sources. In this study, a methodology is proposed that allows the selection of noise models and adjustment of their parameters, considering the nature of the backends (technology, topology, vendor, model, etc.). The proposed methodology is illustrated using a small superconducting example based on the ibm_perth backend (seven qubits) and a comparison between the quantum emulators Qaptiva and Qiskit, where six different noise models are applied, achieving a fidelity deviation of 0.686% at best with respect to the real device.

Quantum architecture search (QAS) involves optimizing both the quantum parametric circuit configuration but also its parameters for a variational quantum algorithm. Thus, the problem is known to be multi-level as the performance of a given architecture is unknown until its parameters are tuned using classical routines. Moreover, the task becomes even more complicated since well-known trainability issues, e.g., barren plateaus (BPs), can occur. In this paper, we aim to achieve two improvements in QAS: (1) to reduce the number of measurements by an online surrogate model of the evaluation process that aggressively discards architectures of poor performance; (2) to avoid training the circuits when BPs are present. To detect the presence of the BPs, we employed a recently developed metric, information content, which only requires measuring the energy values of a small set of parameters to estimate the magnitude of cost function’s gradient. The main idea of this proposal is to leverage a recently developed metric which can be used to detect the onset of vanishing gradients to ensure the overall search avoids such unfavorable regions. We experimentally validate our proposal for the variational quantum eigensolver and showcase that our algorithm is able to find solutions that have been previously proposed in the literature for the Hamiltonians; but also to outperform the state of the art when initializing the method from the set of architectures proposed in the literature. The results suggest that the proposed methodology could be used in environments where it is desired to improve the trainability of known architectures while maintaining good performance.

Recently, the circular connectivity pattern has been presented for a class of stabilizer quantum error correction codes. The circular connectivity pattern for such a class of stabilizer codes can be implemented in a resource-efficient manner using a single ancilla and native two-qubit Controlled-Not-Swap gates (CNS) gates, which may be interesting for demonstrating error-correction codes with superconducting quantum processors. However, one concern is that this scheme is not fault-tolerant. And it might not apply to the Calderbank-Shor-Steane (CSS) codes. In this paper, we present a fault-tolerant version of the circular connectivity pattern, named the double-circular connectivity pattern. This pattern is an implementation for syndrome-measurement circuits with a flagged error correction scheme for stabilizer codes. We illustrate that this pattern is available for Steane code (a CSS code), Laflamme’s five-qubit code, and Shor’s nine-qubit code. For Laflamme’s five-qubit code and Shor’s nine-qubit code, the pattern has the property that it uses only native two-qubit CNS gates, which are more efficient in the superconducting quantum platform.