Quantum Computation Research Articles

Universal control of four singlet-triplet qubits.

The coherent control of interacting spins in semiconductor quantum dots is of strong interest for quantum information processing and for studying quantum magnetism from the bottom up. Here we present a 2 × 4 germanium quantum dot array with full and controllable interactions between nearest-neighbour spins. As a demonstration of the level of control, we define four singlet-triplet qubits in this system and show two-axis single-qubit control of each qubit and SWAP-style two-qubit gates between all neighbouring qubit pairs, yielding average single-qubit gate fidelities of 99.49(8)-99.84(1)% and Bell state fidelities of 73(1)-90(1)%. Combining these operations, we experimentally implement a circuit designed to generate and distribute entanglement across the array. A remote Bell state with a fidelity of 75(2)% and concurrence of 22(4)% is achieved. These results highlight the potential of singlet-triplet qubits as a competing platform for quantum computing and indicate that scaling up the control of quantum dot spins in extended bilinear arrays can be feasible.

Quantum computing and its implications for Asian innovation ecosystems

ABSTRACT Where quantum computing is emerging as a catalyst for innovation, this paper investigates its influence on R&D efficiency and innovation outcomes across 4,500 firms in six key sectors – pharmaceuticals, finance, materials science, energy, telecommunications, and logistics – in Asia between 2015 and 2024. The study employs advanced models, including Agent-Based Modeling (ABM), Bayesian Networks, Support Vector Machines (SVM), and Markov Chains, to analyse the relationship between quantum computing investments and innovation performance. The results indicate that high-R&D sectors, such as pharmaceuticals and finance, benefit most from quantum computing due to its role in accelerating drug discovery and optimising risk management. In contrast, low-R&D sectors like telecommunications and logistics face slower adoption due to infrastructure challenges and limited resources. Government support, particularly through subsidies and tax incentives, enhances the impact of quantum computing investments on innovation outcomes, especially in high-R&D industries. This study addresses key gaps by providing empirical evidence of quantum computing’s role in driving sectoral innovation and offering actionable insights for policymakers and industry leaders.

Enhancing financial fraud detection using adaptive machine learning models and business analytics

Financial fraud continues to be a critical threat to businesses and economies worldwide, necessitating advanced detection techniques. This paper reviews the role of adaptive machine learning (ML) models and business analytics in enhancing fraud detection systems. Traditional fraud detection methods often fall short in addressing the complexity and evolving nature of fraudulent activities, making adaptive ML models, such as decision trees and neural networks, more effective in identifying subtle patterns in large datasets. Organizations can refine ML models by integrating business analytics, ensuring real-time detection and continuous improvement of fraud detection systems. The paper also explores the challenges in deploying these technologies, including data privacy concerns and model accuracy, as well as the potential impact of emerging technologies such as blockchain and quantum computing. Future directions emphasize improving the interpretability of ML models and leveraging multi-modal data for a more holistic approach to fraud prevention. The synergy between adaptive machine learning and business analytics promises a more resilient and effective framework for combating financial fraud.

Facial emotion recognition using deep quantum and advanced transfer learning mechanism

IntroductionFacial expressions have become a common way for interaction among humans. People cannot comprehend and predict the emotions or expressions of individuals through simple vision. Thus, in psychology, detecting facial expressions or emotion analysis demands an assessment and evaluation of decisions for identifying the emotions of a person or any group during communication. With the recent evolution of technology, AI (Artificial Intelligence) has gained significant usage, wherein DL (Deep Learning) based algorithms are employed for detecting facial expressions.MethodsThe study proposes a system design that detects facial expressions by extracting relevant features using a Modified ResNet model. The proposed system stacks building-blocks with residual connections and employs an advanced extraction method with quantum computing, which significantly reduces computation time compared to conventional methods. The backbone stem utilizes a quantum convolutional layer comprised of several parameterized quantum-filters. Additionally, the research integrates residual connections in the ResNet-18 model with the Modified up Sampled Bottle Neck Process (MuS-BNP), retaining computational efficacy while benefiting from residual connections.ResultsThe proposed model demonstrates superior performance by overcoming the issue of maximum similarity within varied facial expressions. The system’s ability to accurately detect and differentiate between expressions is measured using performance metrics such as accuracy, F1-score, recall, and precision.DiscussionThis performance analysis confirms the efficacy of the proposed system, highlighting the advantages of quantum computing in feature extraction and the integration of residual connections. The model achieves quantum superiority, providing faster and more accurate computations compared to existing methodologies. The results suggest that the proposed approach offers a promising solution for facial expression recognition tasks, significantly improving both speed and accuracy.

Impact of AI on cybersecurity and security compliance

Artificial Intelligence (AI) is transforming the field of cybersecurity and reshaping security compliance practices. As cyber threats become increasingly complex, AI offers powerful tools for identifying, mitigating, and preventing attacks in real-time. AI-driven systems excel at processing vast amounts of data, detecting anomalies, and identifying patterns that traditional security systems might miss. Machine learning and deep learning algorithms enhance the ability to predict potential threats, reducing response time and improving the accuracy of threat detection. These capabilities make AI a valuable asset in addressing sophisticated threats such as zero-day vulnerabilities, advanced persistent threats (APTs), and ransomware attacks. In the realm of security compliance, AI plays a pivotal role by automating routine tasks such as monitoring, auditing, and reporting. This reduces the burden on organizations to manually enforce regulatory standards, leading to more efficient compliance with frameworks like GDPR, HIPAA, and PCI-DSS. AI can continuously assess systems to ensure that they meet compliance requirements, enhancing the ability to detect and respond to violations. Furthermore, AI contributes to governance by helping organizations develop robust security policies, track compliance metrics, and streamline incident response. However, the integration of AI in cybersecurity also presents challenges, including adversarial AI, data privacy concerns, and transparency in AI decision-making processes. Additionally, AI-driven attacks are an emerging threat that necessitates further research and regulation. Despite these challenges, the future of AI in cybersecurity and compliance looks promising, with advancements in predictive analytics, quantum computing, and autonomous security systems poised to further revolutionize the field. As AI technologies evolve, they will continue to play a critical role in fortifying cybersecurity defenses and ensuring regulatory compliance across industries.

Magnetic Molecules as Building Blocks for Quantum Technologies

AbstractSince the initial observation of quantum effects, scientists have worked diligently to understand and harness their potential. Thanks to many pioneers, a level where quantum effects can be exploited is reached. Numerous cutting‐edge technologies, such as quantum sensing and quantum computing, are proposed. A common trait in all technologies is the need to manipulate and read out their states; therefore, the quantum characteristics of the building blocks must adhere to strict guidelines. Magnetic Molecules (MMs) are promising candidates. They can be obtained indistinguishably, and the control over their structural and electronic properties, makes them appealing to act as quantum bits or “qubits”. MMs can be connected to other units while preserving their coherence properties, enabling the implementation of quantum gates. Furthermore, the low‐lying energy levels can be exploited as qudits, which can exist in more than 2 states simultaneously (d > 2), allowing them to hold more information efficiently. The larger electronic/nuclear space in qudits can decrease the number of physical units and enhance computational efficiency, reducing error and making them promise for complex problem‐solving. In this perspective article, the physical characteristics of MMs and key achievements that position them as promising candidates for quantum technologies, are described.

Solving transport equations on quantum computers—potential and limitations of physics-informed quantum circuits

AbstractQuantum circuits with trainable parameters, paired with classical optimization routines can be used as machine learning models. The recently popularized physics-informed neural network (PINN) approach is a machine learning algorithm that solves differential equations by incorporating them into a loss function. Being a mesh-free method, it is a promising approach for computational fluid dynamics. The question arises whether the properties of quantum circuits can be leveraged for a quantum physics-informed machine learning model. In this study, we compare the classical PINN-ansatz and its quantum analog, which we name the physics-informed quantum circuit (PIQC). The PIQC simulations are performed on a noise-free quantum computing simulator. Studying various differential equations, we compare expressivity, accuracy and convergence properties. We find that one-dimensional problems, such as the linear transport of a Gaussian-pulse or Burgers’ equation, allow a successful approximation with the classical and the quantum ansatz. For these examples, the PIQC overall performs similarly to PINN and converges more consistently and for Burgers’ equations even faster. While this is promising, the chosen quantum circuit approach struggles to approximate discontinuous solutions which the classical PINN-ansatz can represent. Based on this comparison, we extrapolate that the required number of qubits for solving two-dimensional problems in aerodynamics may already be available in the next few years. However, the acceleration potential is currently unclear and challenges like noisy circuits and approximations of discontinuous solutions have to be overcome.

Laser beams offer simplified calculations for quantum computing

Well-established optical computing methods can be used to execute vector-matrix algebra for quantum computing.

Novel Application of Quantum Computing for Routing and Spectrum Assignment in Flexi-Grid Optical Networks

Flexi-grid technology has revolutionized optical networking by enabling Elastic Optical Networks (EONs) that offer greater flexibility and dynamism compared to traditional fixed-grid systems. As data traffic continues to grow exponentially, the need for efficient and scalable solutions to the routing and spectrum assignment (RSA) problem in EONs becomes increasingly critical. The RSA problem, being NP-Hard, requires solutions that can simultaneously address both spatial routing and spectrum allocation. This paper proposes a novel quantum-based approach to solving the RSA problem. By formulating the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model, we employ the Quantum Approximate Optimization Algorithm (QAOA) to effectively solve it. Our approach is specifically designed to minimize end-to-end delay while satisfying the continuity and contiguity constraints of frequency slots. Simulations conducted using the Qiskit framework and IBM-QASM simulator validate the effectiveness of our method. We applied the QAOA-based RSA approach to small network topology, where the number of nodes and frequency slots was constrained by the limited qubit count on current quantum simulator. In this small network, the algorithm successfully converged to an optimal solution in less than 30 iterations, with a total runtime of approximately 10.7 s with an accuracy of 78.8%. Additionally, we conducted a comparative analysis between QAOA, integer linear programming, and deep reinforcement learning methods to evaluate the performance of the quantum-based approach relative to classical techniques. This work lays the foundation for future exploration of quantum computing in solving large-scale RSA problems in EONs, with the prospect of achieving quantum advantage as quantum technology continues to advance.

An Applied Analysis of Securing 5G/6G Core Networks with Post-Quantum Key Encapsulation Methods

Fifth Generation (5G) cellular networks have been adopted worldwide since the rollout began around 2019. It brought with it many innovations and new services, such as Enhanced Mobile Broadband (eMBB), Ultra Reliable and Low-Latency Communications (URLLC), and Massive Internet of Things (mIoT). Furthermore, 5G introduced a more scalable approach to network operations using fully software-based Virtualized Network Functions (VNF) in Core Networks (CN) rather than the prior hardware-based approach. However, while this shift towards a fully software-based system design provides numerous significant benefits, such as increased interoperability, scalability, and cost-effectiveness, it also brings with it an increased cybersecurity risk. Security is crucial to maintaining trust between vendors, operators, and consumers. Cyberattacks are rapidly increasing in number and sophistication, and we are seeing a shift towards zero-trust approaches. This means that even communications between VNFs inside a 5G core must be scrutinized and hardened against attacks, especially with the advent of quantum computers. The National Institute of Standards and Technology (NIST), over the past 10 years, has led efforts to standardize post-quantum cryptography (PQC) to protect against quantum attacks. This paper covers a custom implementation of the open-source free5GC CN, to expand its HTTPS capabilities for VNFs by introducing PQC Key Encapsulation Methods (KEM) for Transport Layer Security (TLS) v1.3. This paper provides the details of this integration with a focus on the latency of different PQC KEMs in initial handshakes between VNFs, on packet size, and the implications in a 5G environment. This work also conducts a security comparison between the PQC-equipped free5GC and other open-source 5G CNs. The presented results indicate a negligible increase in UE connection setup duration and a small increase in connection setup data requirements, strongly indicating that PQC KEM’s benefits far outweigh any downsides when integrated into 5G and 6G core services. To the best of our knowledge, this is the first work incorporating PQC into an open-source 5G core. Furthermore, the results from this effort demonstrate that employing PQC ciphers for securing VNF communications results in only a negligible impact on latency and bandwidth usage, thus demonstrating significant benefits to 5G cybersecurity.

Optimized Noise Suppression for Quantum Circuits

Quantum computation promises to advance a wide range of computational tasks. However, current quantum hardware suffers from noise and is too small for error correction. Thus, accurately utilizing noisy quantum computers strongly relies on noise characterization, mitigation, and suppression. Crucially, these methods must also be efficient in terms of their classical and quantum overhead. Here, we efficiently characterize and mitigate crosstalk noise, which is a severe error source in, for example, cross-resonance based superconducting quantum processors. For crosstalk characterization, we develop a simplified measurement experiment. Furthermore, we analyze the problem of optimal experiment scheduling and solve it for common hardware architectures. After characterization, we mitigate noise in quantum circuits by a noise-aware qubit routing algorithm. Our integer programming algorithm extends previous work on optimized qubit routing by swap insertion. We incorporate the measured crosstalk errors in addition to other, more easily accessible noise data in the objective function. Furthermore, we strengthen the underlying integer linear model by proving a convex hull result about an associated class of polytopes, which has applications beyond this work. We evaluate the proposed method by characterizing crosstalk noise for two chips with up to 127 qubits and leverage the resulting data to improve the approximation ratio of the Quantum Approximate Optimization Algorithm by up to 10% compared with other established noise-aware routing methods. Our work clearly demonstrates the gains of including noise data when mapping abstract quantum circuits to hardware native ones. History: Accepted by Giacomo Nannicini, Area Editor for Quantum Computing and Operations Research. Accepted for Special Issue on Quantum Computing. Funding: This work was supported by Bavarian state government; Bayerische Staatsministerium für Wirtschaft, Landesentwicklung und Energie. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0551 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0551 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

A Comprehensive Review of MI-HFE and IPHFE Cryptosystems: Advances in Internal Perturbations for Post-Quantum Security

The RSA cryptosystem has been a cornerstone of modern public key infrastructure; however, recent advancements in quantum computing and theoretical mathematics pose significant risks to its security. The advent of fully operational quantum computers could enable the execution of Shor’s algorithm, which efficiently factors large integers and undermines the security of RSA and other cryptographic systems reliant on discrete logarithms. While Grover’s algorithm presents a comparatively lesser threat to symmetric encryption, it still accelerates key search processes, creating potential vulnerabilities. In light of these challenges, there has been an intensified focus on developing quantum-resistant cryptography. Current research is exploring cryptographic techniques based on error-correcting codes, lattice structures, and multivariate public key systems, all of which leverage the complexity of NP-hard problems, such as solving multivariate quadratic equations, to ensure security in a post-quantum landscape. This paper reviews the latest advancements in quantum-resistant encryption methods, with particular attention to the development of robust trapdoor functions. It also provides a detailed analysis of prominent multivariate cryptosystems, including the Matsumoto–Imai, Oil and Vinegar, and Polly Cracker schemes, alongside recent progress in lattice-based systems such as Kyber and Crystals-DILITHIUM, which are currently under evaluation by NIST for potential standardization. As the capabilities of quantum computing continue to expand, the need for innovative cryptographic solutions to secure digital communications becomes increasingly critical.

Broadband spin-dependent anti-reflection in chiral time-varying metamaterials

Time-varying metamaterials have garnered significant attention for their ability to achieve anti-reflection in the time domain. However, current systems face limitations in spin-controlled manipulation, as most studies focus on non-chiral, time-varying metamaterials. Consequently, realizing spin-dependent broadband anti-reflection using time-varying chiral metamaterials remains underexplored. In this work, we propose a time-varying chiral structure composed of four temporal layers, each with distinct impedances and chiral parameters. By carefully adjusting these parameters across the layers, our structure enables broadband anti-reflection for both right- and left-circularly polarized (RCP and LCP) waves under small chiral conditions. Under large chiral parameters, the structure selectively achieves broadband anti-reflection for LCP waves, while consistently reflecting RCP waves across the bandwidth. This unique spin-dependent broadband anti-reflection results from significant phase delays between RCP and LCP waves, a feature not achievable by non-chiral, time-varying multilayer structures. Additionally, the proposed structure allows impedance matching between chiral and non-chiral dielectric spatial-temporal slabs in finite regions under small chiral parameters. These findings offer promising avenues for advanced wave manipulation in chiral metamaterials, with potential applications in broadband absorbers, filters, and quantum information processing systems.

Universal quantum processors in spin systems via robust local pulse sequences

We propose a protocol to realize quantum simulation and computation in spin systems with long-range interactions. Our approach relies on the local addressing of single spins with external fields parametrized by Walsh functions. This enables a mapping from a class of target Hamiltonians, defined by the graph structure of their interactions, to pulse sequences. We then obtain a recipe to implement arbitrary two-body Hamiltonians and universal quantum circuits. Performance guarantees are provided in terms of bounds on Trotter errors and total number of pulses. Additionally, Walsh pulse sequences are shown to be robust against various types of pulse errors, in contrast to previous hybrid digital-analog schemes of quantum computation. We demonstrate and numerically benchmark our protocol with examples from the dynamics of spin models, quantum error correction and quantum optimization algorithms.

RadicalPy: A Tool for Spin Dynamics Simulations.

Radical pairs (electron-hole pairs, polaron pairs) are transient reaction intermediates that are found and exploited in all areas of science, from the hard realm of physics in the form of organic semiconductors, spintronics, quantum computing, and solar cells to the soft domain of chemistry and biology under the guise of chemical reactions in solution, biomimetic systems, and quantum biology. Quantitative analysis of radical pair phenomena has historically been successful by a few select groups. With this in mind, we present an intuitive open-source framework in the Python programming language that provides classical, semiclassical, and quantum simulation methodologies. A radical pair kinetic rate equation solver, Monte Carlo-based spin dephasing rate estimations, and molecule database functionalities are implemented. We introduce the kine-quantum method, a new approach that amalgamates classical rate equations, semiclassical, and quantum techniques. This method resolves the prohibitively large memory requirement issues of quantum approaches while achieving higher accuracy, and it also offers wavelength-resolved simulations, producing time- and wavelength-resolved magnetic field effect simulations. Model examples illustrate the versatility and ease of use of the software, including the new approach applied to the magnetosensitive absorption and fluorescence of flavin adenine dinucleotide photochemistry, spin-spin interaction estimation from molecular dynamics simulations on radical pairs inside reverse micelles, radical pair anisotropy inside proteins, and triplet exciton pairs in anthracene crystals. The intuitive interface also allows this software to be used as a teaching or learning aid for those interested in the field of spin chemistry. Furthermore, the software aims to be modular and extensible, with the aim to standardize how spin dynamics simulations are performed.

Efficient Implementation of Interior-Point Methods for Quantum Relative Entropy

Quantum relative entropy (QRE) programming is a recently popular and challenging class of convex optimization problems with significant applications in quantum computing and quantum information theory. We are interested in modern interior-point (IP) methods based on optimal self-concordant barriers for the QRE cone. A range of theoretical and numerical challenges associated with such barrier functions and the QRE cones have hindered the scalability of IP methods. To address these challenges, we propose a series of numerical and linear algebraic techniques and heuristics aimed at enhancing the efficiency of gradient and Hessian computations for the self-concordant barrier function, solving linear systems, and performing matrix-vector products. We also introduce and deliberate about some interesting concepts related to QRE such as symmetric quantum relative entropy. We design a two-phase method for performing facial reduction that can significantly improve the performance of QRE programming. Our new techniques have been implemented in the latest version (DDS 2.2) of the software package Domain-Driven Solver (DDS). In addition to handling QRE constraints, DDS accepts any combination of several other conic and nonconic convex constraints. Our comprehensive numerical experiments encompass several parts, including (1) a comparison of DDS 2.2 with Hypatia for the nearest correlation matrix problem, (2) using DDS 2.2 for combining QRE constraints with various other constraint types, and (3) calculating the key rate for quantum key distribution (QKD) channels and presenting results for several QKD protocols. History: Accepted by Giacomo Nannicini, Area Editor for Quantum Computing and Operations Research. Accepted for Special Issue. Funding: This work was supported by the National Science Foundation [Grant CMMI-2347120] and Discovery Grants from the Natural Sciences and Engineering Research Council of Canada. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0570 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0570 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Revolutionizing Optimization: The Game-Changing Power of Quantum Algorithms and Next-Generation Computational Technologies

Quantum algorithms offer promising advancements in solving complex optimization problems that are critical in various fields, including logistics, finance, and machine learning. Classical optimization techniques, while effective, often struggle with large-scale and high-dimensional data sets, leading to inefficiencies and long processing times.Quantum algorithms, leveraging the principles of superposition, entanglement, and quantum parallelism, provide a potential solution by exponentially speeding up certain computational tasks. This paper explores key quantum algorithms for optimization, including Grover's algorithm, the Quantum Approximate Optimization Algorithm (QAOA), and the Quantum Annealing method. We analyze their theoretical foundations, implementation challenges, and practical applications. Special attention is given to the performance comparisons between quantum and classical approaches in solving combinatorial optimization problems, such as the traveling salesman problem and portfolio optimization. We also discuss the limitations of current quantum hardware and the prospects for future improvements that could make quantum optimization algorithms more practical for real-world use.Our findings suggest that, while quantum algorithms are still in their early stages, they hold immense potential for transforming optimization in a variety of domains, offering new pathways toward more efficient problem-solving in both theoretical and applied contexts. we explore how hybrid quantum-classical approaches can enhance optimization results by combining the strengths of both paradigms. Future research directions are highlighted, focusing on improving quantum error correction, scaling quantum systems, and developing more robust quantum algorithms to tackle increasingly complex optimization problems.

Controlled Spalling of 4H Silicon Carbide with Investigated Spin Coherence for Quantum Engineering Integration.

We detail scientific and engineering advances which enable the controlled spalling and layer transfer of single crystal 4H silicon carbide (4H-SiC) from bulk substrates. 4H-SiC's properties, including high thermal conductivity and a wide bandgap, make it an ideal semiconductor for power electronics. Moreover, 4H-SiC is an excellent host of solid-state atomic defect qubits for quantum computing and quantum networking. Because 4H-SiC substrates are expensive (due to long growth times and limited yield), techniques for removal and transfer of bulk-quality films are desirable for substrate reuse and integration of the separated films. In this work, we utilize updated approaches for stressor layer thickness control and spalling crack initiation to demonstrate controlled spalling of 4H-SiC, the highest fracture toughness crystal spalled to date. We achieve coherent spin control of neutral divacancy (VV0) qubit ensembles and measure a quasi-bulk spin T2 of 79.7 μs in the spalled films.

Native multi-qubit gates in transmon qubits via synchronous driving

Quantum computation holds the promise of solving computational problems which are believed to be classically intractable. However, in practice, quantum devices are still limited by their relatively short coherence times and imperfect circuit-hardware mapping. In this work, we present the parallelization of pre-calibrated pulses at the hardware level as an easy-to-implement strategy to optimize quantum gates. Focusing on RZX\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$R_{ZX}$$\\end{document} gates, we demonstrate that such parallelization leads to improved fidelity and gate time reduction, when compared to serial concatenation. As measured by Cycle Benchmarking and Process Tomography, we reduce gate errors by half. We show that this strategy can be applied to other gates like the CNOT and CZ, and it may benefit tasks such as Hamiltonian simulation problems, amplitude amplification, and error-correction codes.

A qubit-efficient variational selected configuration-interaction method

Abstract Finding the ground-state energy of molecules is an important and challenging computational problem for which quantum computing can potentially find efficient solutions. The variational quantum eigensolver (VQE) is a quantum algorithm that tackles the molecular groundstate problem and is regarded as one of the flagships of quantum computing. Yet, to date, only very small molecules were computed via VQE, due to high noise levels in current quantum devices. Here we present an alternative variational quantum scheme that requires significantly less qubits than VQE. The reduction in the qubit number allows for shallower circuits to be sufficient, rendering the method more resistant to noise. The proposed algorithm, termed variational quantum selected-configuration-interaction (VQ-SCI), is based on: (a) representing the target groundstate as a superposition of Slater determinant configurations, encoded directly upon the quantum computational basis states; and (b) selecting a-priory only the most dominant configurations. This is demonstrated through a set of groundstate calculations of the H2, LiH, BeH2, H2O, NH3 and C2H4 molecules in the sto-3g basis set, performed on IBM quantum devices. We show that the VQ-SCI reaches the full configuration interaction energy within chemical accuracy using the lowest number of qubits reported to date. Moreover, when the SCI matrix is generated ‘on the fly’, the VQ-SCI requires exponentially less memory than classical SCI methods. This offers a potential remedy to a severe memory bottleneck problem in classical SCI calculations. Finally, the proposed scheme is general and can be straightforwardly applied for finding the groundstate of any Hermitian matrix, outside the chemical context.