RESUMEN

Quantum machine learning has made remarkable progress in many important tasks. However, the gate complexity of the initial state preparation is seldom considered in lots of quantum machine learning algorithms, making them non-end-to-end. Herein, we propose a quantum algorithm for the node embedding problem that maps a node graph's topological structure to embedding vectors. The resulting quantum embedding state can be used as an input for other quantum machine learning algorithms. With O ( log ( N ) ) qubits to store the information of N nodes, our algorithm will not lose quantum advantage for the subsequent quantum information processing. Moreover, owing to the use of a parameterized quantum circuit with O ( poly ( log ( N ) ) ) depth, the resulting state can serve as an efficient quantum database. In addition, we explored the measurement complexity of the quantum node embedding algorithm, which is the main issue in training parameters, and extended the algorithm to capture high-order neighborhood information between nodes. Finally, we experimentally demonstrated our algorithm on an nuclear magnetic resonance quantum processor to solve a graph model.

RESUMEN

The impact of Artificial Intelligence (AI) is rapidly expanding, revolutionizing both science and society. It is applied to practically all areas of life, science, and technology, including materials science, which continuously requires novel tools for effective materials characterization. One of the widely used techniques is scanning probe microscopy (SPM). SPM has fundamentally changed materials engineering, biology, and chemistry by providing tools for atomic-precision surface mapping. Despite its many advantages, it also has some drawbacks, such as long scanning times or the possibility of damaging soft-surface materials. In this paper, we focus on the potential for supporting SPM-based measurements, with an emphasis on the application of AI-based algorithms, especially Machine Learning-based algorithms, as well as quantum computing (QC). It has been found that AI can be helpful in automating experimental processes in routine operations, algorithmically searching for optimal sample regions, and elucidating structure-property relationships. Thus, it contributes to increasing the efficiency and accuracy of optical nanoscopy scanning probes. Moreover, the combination of AI-based algorithms and QC may have enormous potential to enhance the practical application of SPM. The limitations of the AI-QC-based approach were also discussed. Finally, we outline a research path for improving AI-QC-powered SPM. RESEARCH HIGHLIGHTS: Artificial intelligence and quantum computing as support for scanning probe microscopy. The analysis indicates a research gap in the field of scanning probe microscopy. The research aims to shed light into ai-qc-powered scanning probe microscopy.

RESUMEN

Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put forward. After a few years of rapid growth, leading to an implementation of Shor's quantum factoring algorithm in a seven-spin system, the field started to reach its natural limits and further progress became challenging. Rather than pursuing more complex algorithms on larger systems, interest has now largely moved into developing techniques for the precise and efficient manipulation of spin states with the aim of developing methods that can be applied in other more scalable technologies and within conventional NMR. However, the user friendliness of NMR implementations means that they remain popular for proof-of-principle demonstrations of simple quantum information protocols.

RESUMEN

The intricate nature of lung cancer treatment poses considerable challenges upon diagnosis. Early detection plays a pivotal role in mitigating its escalating global mortality rates. Consequently, there are pressing demands for robust and dependable early detection and diagnostic systems. However, the technological limitations and complexity of the disease make it challenging to implement an efficient lung cancer screening system. AI-based CT image analysis techniques are showing significant contributions to the development of computer-assisted detection (CAD) systems for lung cancer screening. Various existing research groups are working on implementing CT image analysis systems for assessing and classifying lung cancer. However, the complexity of different structures inside the CT image is high and comprehension of significant information inherited by them is more complex even after applying advanced feature extraction and feature selection techniques. Traditional and classical feature selection techniques may struggle to capture complex interdependencies between features. They may get stuck in local optima and sometimes require additional exploration strategies. Traditional techniques may also struggle with combinatorial optimization problems when applied to a prominent feature space. This paper proposed a methodology to overcome the existing challenges by applying feature extraction using Vision Transformer (FexViT) and Feature selection using the Quantum Computing based Quadratic unconstrained binary optimization (QC-FSelQUBO) technique. This algorithm shows better performance when compared with other existing techniques. The proposed methodology showed better performance as compared to other existing techniques when evaluated by applying necessary output measures, such as accuracy, Area under roc (receiver operating characteristics) curve, precision, sensitivity, and specificity, obtained as 94.28%, 99.10%, 96.17%, 90.16% and 97.46%. The further advancement of CAD systems is essential to meet the demand for more reliable detection and diagnosis of cancer, which can be addressed by leading the proposed quantum computation and growing AI-based technology ahead.

Asunto(s)

RESUMEN

Facing to a planar tracking problem, a multiple-interpretable improved Proximal Policy Optimization (PPO) algorithm with few-shot technique is proposed, namely F-GBQ-PPO. Compared with the normal PPO, the main improvements of F-GBQ-PPO are to increase the interpretability, and reduce the consumption for real interaction samples. Considering to increase incomprehensibility of a tracking policy, three levels of interpretabilities has been studied, including the perceptual, logical and mathematical interpretabilities. Detailly speaking, it is realized through introducing a guided policy based on Apollonius circle, a hybrid exploration policy based on biological motions, and the update of external parameters based on quantum genetic algorithm. Besides, to deal with the potential lack of real interaction samples in real applications, a few-shot technique is contained in the algorithm, which mainly generate fake samples through a multi-dimension Gaussian process. By mixing fake samples with real ones in a certain proportion, the demand for real samples can be reduced.

RESUMEN

Any single system whose space of states is given by a separable Hilbert space is automatically equipped with infinitely many hidden tensor-like structures. This includes all quantum mechanical systems as well as classical field theories and classical signal analysis. Accordingly, systems as simple as a single one-dimensional harmonic oscillator, an infinite potential well, or a classical finite-amplitude signal of finite duration can be decomposed into an arbitrary number of subsystems. The resulting structure is rich enough to enable quantum computation, violation of Bell's inequalities, and formulation of universal quantum gates. Less standard quantum applications involve a distinction between position and hidden position. The hidden position can be accompanied by a hidden spin, even if the particle is spinless. Hidden degrees of freedom are, in many respects, analogous to modular variables. Moreover, it is shown that these hidden structures are at the roots of some well-known theoretical constructions, such as the Brandt-Greenberg multi-boson representation of creation-annihilation operators, intensively investigated in the context of higher-order or fractional-order squeezing. In the context of classical signal analysis, the discussed structures explain why it is possible to emulate a quantum computer by classical analog circuit devices.

RESUMEN

We investigate the computational efficiency and thermodynamic cost of the D-Wave quantum annealer under reverse-annealing with and without pausing. Our demonstration on the D-Wave 2000Q annealer shows that the combination of reverse-annealing and pausing leads to improved computational efficiency while minimizing the thermodynamic cost compared to reverse-annealing alone. Moreover, we find that the magnetic field has a positive impact on the performance of the quantum annealer during reverse-annealing but becomes detrimental when pausing is involved. Our results, which are reproducible, provide strategies for optimizing the performance and energy consumption of quantum annealing systems employing reverse-annealing protocols.

RESUMEN

Major countries like the USA, European Union, UK, Japan, Canada, Australia, Singapore, and China have taken significant initiatives to develop quantum computation infrastructure. India has also taken several steps to join the quantum computation family. The Indian government has taken several initiatives to build the nation's infrastructure on quantum computation and participate in the global quantum landscape. The Indian government has created a roadmap in this direction. The significant steps are: firstly, noteworthy budget allocation (1.12 billion USD in 2020 and 734 million USD for the National Quantum Mission in 2023); secondly, 21 quantum hubs are being developed throughout the country; thirdly, 4 quantum research parks have been created and finally, Department of Science and Technology (DST) has initiated QuEST (Quantum Enabled Science and Technology) programme during 2017-18. The article also discusses other effective strategies and moves by the Indian government, like different ambitious national missions on quantum science and technology to create the country's ecosystem. In that direction, the article addresses the opportunities and challenges of quantum science and technology for India. However, the Indian government should encourage quantum computation research more for the country's development. Finally, the information provided here depicts an overall view of India's quantum computation landscape.

RESUMEN

For quantum computing (QC) to emerge as a practically indispensable computational tool, there is a need for quantum protocols with end-to-end practical applications-in this instance, fluid dynamics. We debut here a high-performance quantum simulator which we term QFlowS (Quantum Flow Simulator), designed for fluid flow simulations using QC. Solving nonlinear flows by QC generally proceeds by solving an equivalent infinite dimensional linear system as a result of linear embedding. Thus, we first choose to simulate two well-known flows using QFlowS and demonstrate a previously unseen, full gate-level implementation of a hybrid and high precision Quantum Linear Systems Algorithms (QLSA) for simulating such flows at low Reynolds numbers. The utility of this simulator is demonstrated by extracting error estimates and power law scaling that relates [Formula: see text] (a parameter crucial to Hamiltonian simulations) to the condition number [Formula: see text] of the simulation matrix and allows the prediction of an optimal scaling parameter for accurate eigenvalue estimation. Further, we include two speedup preserving algorithms for a) the functional form or sparse quantum state preparation and b) in situ quantum postprocessing tool for computing nonlinear functions of the velocity field. We choose the viscous dissipation rate as an example, for which the end-to-end complexity is shown to be [Formula: see text], where [Formula: see text] is the size of the linear system of equations, [Formula: see text] is the solution error, and [Formula: see text] is the error in postprocessing. This work suggests a path toward quantum simulation of fluid flows and highlights the special considerations needed at the gate-level implementation of QC.

RESUMEN

Nanostructures, fabricated by locating molecular building blocks in well-defined positions, for example, on a lattice, are ideal platforms for studying atomic-scale quantum effects. In this context, STM data obtained from self-assembled Bis(phthalocyaninato) Terbium (III) (TbPc2) single-molecule magnets on various substrates have raised questions about the conformation of the TbPc2 molecules within the lattice. In order to address this issue, molecular dynamics simulations were carried out on a 2D assembly of TbPc2 molecules. The calculations are in excellent agreement with the experiment, and thus improve our understanding of the self-assembly process. In particular, the calculated electron density of the molecular assembly compares well with STM contrast of self-assembled TbPc2 on Au(111), simultaneously providing the conformation of the two Pc ligands of the individual double-decker molecule. This approach proves valuable in the identification of the STM contrast of LnPc2 layers and could be used in similar cases where it is difficult to interpret the STM images of an assembly of molecular complexes.

RESUMEN

Adversarial transfer learning is a machine learning method that employs an adversarial training process to learn the datasets of different domains. Recently, this method has attracted attention because it can efficiently decouple the requirements of tasks from insufficient target data. In this study, we introduce the notion of quantum adversarial transfer learning, where data are completely encoded by quantum states. A measurement-based judgment of the data label and a quantum subroutine to compute the gradients are discussed in detail. We also prove that our proposal has an exponential advantage over its classical counterparts in terms of computing resources such as the gate number of the circuits and the size of the storage required for the generated data. Finally, numerical experiments demonstrate that our model can be successfully trained, achieving high accuracy on certain datasets.

RESUMEN

The positions of Abrikosov vortices have long been considered as means to encode classical information. Although it is possible to move individual vortices using local probes, the challenge of scalable on-chip vortex-control remains outstanding, especially when considering the demands of controlling multiple vortices. Realization of vortex logic requires means to shuttle vortices reliably between engineered pinning potentials, while concomitantly keeping all other vortices fixed. We demonstrate such capabilities using Nb loops patterned below a NbSe2 layer. SQUID-on-Tip (SOT) microscopy reveals that the loops localize vortices in designated sites to a precision better than 100 nm; they realize "push" and "pull" operations of vortices as far as 3 µm. Successive application of such operations shuttles a vortex between adjacent loops. Our results may be used as means to integrate vortices in future quantum circuitry. Strikingly, we demonstrate a winding operation, paving the way for future topological quantum computing and simulations.

RESUMEN

In The cognitive-emotional brain, Pessoa overlooks continuum effects on nonlinear brain network connectivity by eschewing neural field theories and physiologically derived constructs representative of neuronal plasticity. The absence of this content, which is so very important for understanding the dynamic structure-function embedding and partitioning of brains, diminishes the rich competitive and cooperative nature of neural networks and trivializes Pessoa's arguments, and similar arguments by other authors, on the phylogenetic and operational significance of an optimally integrated brain filled with variable-strength neural connections. Riemannian neuromanifolds, containing limit-imposing metaplastic Hebbian- and antiHebbian-type control variables, simulate scalable network behavior that is difficult to capture from the simpler graph-theoretic analysis preferred by Pessoa and other neuroscientists. Field theories suggest the partitioning and performance benefits of embedded cognitive-emotional networks that optimally evolve between exotic classical and quantum computational phases, where matrix singularities and condensations produce degenerate structure-function homogeneities unrealistic of healthy brains. Some network partitioning, as opposed to unconstrained embeddedness, is thus required for effective execution of cognitive-emotional network functions and, in our new era of neuroscience, should be considered a critical aspect of proper brain organization and operation.

RESUMEN

The prediction of financial crashes in a complex financial network is known to be an NP-hard problem, which means that no known algorithm can efficiently find optimal solutions. We experimentally explore a novel approach to this problem by using a D-Wave quantum annealer, benchmarking its performance for attaining a financial equilibrium. To be specific, the equilibrium condition of a nonlinear financial model is embedded into a higher-order unconstrained binary optimization (HUBO) problem, which is then transformed into a spin-1/2 Hamiltonian with at most, two-qubit interactions. The problem is thus equivalent to finding the ground state of an interacting spin Hamiltonian, which can be approximated with a quantum annealer. The size of the simulation is mainly constrained by the necessity of a large number of physical qubits representing a logical qubit with the correct connectivity. Our experiment paves the way for the codification of this quantitative macroeconomics problem in quantum annealers.

RESUMEN

Abrupt-motion tracking is challenging due to the target's unpredictable action. Although particle filter (PF) is suitable for target tracking of nonlinear non-Gaussian systems, it suffers from the problems of particle impoverishment and sample-size dependency. This paper proposed a quantum-inspired particle filter for abrupt-motion tracking. We apply the concept of quantum superposition to transform classical particles into quantum particles. Quantum representation and corresponding quantum operations are addressed to utilize quantum particles. The superposition property of quantum particles avoids the concerns of particle impoverishment and sample-size dependency. The proposed diversity-preserving quantum-enhanced particle filter (DQPF) obtains better accuracy and stability with fewer particles. A smaller sample size also helps to reduce computational complexity. Moreover, it has significant advantages for abrupt-motion tracking. The quantum particles are propagated at the prediction stage. They will exist at possible places when abrupt motion occurs, which reduces the tracking delay and enhances the tracking accuracy. This paper conducted experiments compared to state-of-the-art particle filter algorithms. The numerical results demonstrate that the DQPF is not susceptible to motion mode and particle number. Meanwhile, DQPF maintains excellent accuracy and stability.

RESUMEN

The small size and excellent integrability of silicon metal-oxide-semiconductor (SiMOS) quantum dot spin qubits make them an attractive system for mass-manufacturable, scaled-up quantum processors. Furthermore, classical control electronics can be integrated on-chip, in-between the qubits, if an architecture with sparse arrays of qubits is chosen. In such an architecture qubits are either transported across the chip via shuttling or coupled via mediating quantum systems over short-to-intermediate distances. This paper investigates the charge and spin characteristics of an elongated quantum dot-a so-called jellybean quantum dot-for the prospects of acting as a qubit-qubit coupler. Charge transport, charge sensing, and magneto-spectroscopy measurements are performed on a SiMOS quantum dot device at mK temperature and compared to Hartree-Fock multi-electron simulations. At low electron occupancies where disorder effects and strong electron-electron interaction dominate over the electrostatic confinement potential, the data reveals the formation of three coupled dots, akin to a tunable, artificial molecule. One dot is formed centrally under the gate and two are formed at the edges. At high electron occupancies, these dots merge into one large dot with well-defined spin states, verifying that jellybean dots have the potential to be used as qubit couplers in future quantum computing architectures.

RESUMEN

The K-nearest neighbor (KNN) algorithm is one of the most extensively used classification algorithms, while its high time complexity limits its performance in the era of big data. The quantum K-nearest neighbor (QKNN) algorithm can handle the above problem with satisfactory efficiency; however, its accuracy is sacrificed when directly applying the traditional similarity measure based on Euclidean distance. Inspired by the Polar coordinate system and the quantum property, this work proposes a new similarity measure to replace the Euclidean distance, which is defined as Polar distance. Polar distance considers both angular and module length information, introducing a weight parameter adjusted to the specific application data. To validate the efficiency of Polar distance, we conducted various experiments using several typical datasets. For the conventional KNN algorithm, the accuracy performance is comparable when using Polar distance for similarity measurement, while for the QKNN algorithm, it significantly outperforms the Euclidean distance in terms of classification accuracy. Furthermore, the Polar distance shows scalability and robustness superior to the Euclidean distance, providing an opportunity for the large-scale application of QKNN in practice.

RESUMEN

We investigate the effect of stochastic control errors in the time-dependent Hamiltonian on isolated quantum dynamics. The control errors are formulated as time-dependent stochastic noise in the Schrödinger equation. For a class of stochastic control errors, we establish a threshold theorem that provides a sufficient condition to obtain the target state, which should be determined in noiseless isolated quantum dynamics, as a relation between the number of measurements and noise strength. The theorem guarantees that if the sum of the noise strengths is less than the inverse of computational time, the target state can be obtained through a constant-order number of measurements. If the opposite is true, the number of measurements to guarantee obtaining the target state increases exponentially with computational time. Our threshold theorem can be applied to any isolated quantum dynamics such as quantum annealing and adiabatic quantum computation. This article is part of the theme issue 'Quantum annealing and computation: challenges and perspectives'.

RESUMEN

We build and analyse the network of 100 top-cited nodes (research papers and books from Google Scholar; the strength or citation of the nodes range from about 44 000 up to 100) starting in early 1980 until last year. These searched publications (papers and books) are based on Quantum Annealing Computation and Information categorized into four different sets: (A) Quantum/Transverse Field Spin Glass Model, (B) Quantum Annealing, (C) Quantum Adiabatic Computation and (D) Quantum Computation Information in the title or abstract of the searched publications. We fitted the growth in the annual number of publication ([Formula: see text]) in each of these four categories, A-D, to the form [Formula: see text] where [Formula: see text] denotes the time in years. We found the scaling time [Formula: see text] to be of the order of about 10 years for categories A and C, whereas [Formula: see text] is of the order of about 5 years for categories B and D. This article is part of the theme issue 'Quantum annealing and computation: challenges and perspectives'.

RESUMEN

In the introductory article of this theme issue, we provide an overview of quantum annealing and computation with a very brief summary of the individual contributions to this issue made by experts as well as a few young researchers. We hope the readers will get the touch of the excitement as well as the perspectives in this unusually active field and important developments there. This article is part of the theme issue 'Quantum annealing and computation: challenges and perspectives'.