Investment

Funding and financial news

42,637 ArticlesUpdated Daily
Showing 12 of 42,637 articles
5 Quantum Computing Stocks Investors Should Be Watching in 2027quantum-computing

5 Quantum Computing Stocks Investors Should Be Watching in 2027

For many years, quantum computing was little more than a weird, niche lab project that investors read about, but that relatively few bought into. 2026 changed that. A wave of companies went public through mergers and listings, and names most people ignored a year ago now carry market values in the billions. Some of them build actual quantum computers. Others make the lasers, chips, and security tools that those machines need. Here are five I think deserve a spot on your quantum computing stock list heading into 2027, with what each company is doing and where the trouble spots are. Image source: Getty Images. 1. Quantum Computing Quantum Computing Inc. (QUBT +0.58%) started as a small software operation, but it's a much different business now. Through a series of acquisitions, including Luminar Semiconductor, it runs its own chip manufacturing and offers foundry services for thin-film lithium niobate chips. Those chips transmit data via pulses of light rather than electricity, which increases signal speed and generates less heat. As of its last quarterly report, the company had about $1.3 billion in cash and investments on its books, which gives it some room to keep buying. The concern for investors is that most of its growth has come from those acquisitions. First-quarter revenue jumped from $39,000 to $3.7 million, a rise the company tied to its purchase of Luminar Semiconductor, and it has spent about $180 million in cash on acquisitions so far this year.  The question is how well all of these acquired businesses will fit together and whether customers will pay for the result. QUBT - Quantum Computing$6.91+$0.04 (+0.58%)NASDAQ · As of 4:00 PM ET 10/28/26Premium FeatureMoneyball Superscore45/100Key data pointsMarket capMarket cap calculated using publicly traded shares outstanding only. Does not include unlisted, private, or dual-class non-traded shares. Implied market cap may vary.$1.56BDay's range$6.72 - $6.9452wk range$6.08 - $16.79Volume42.8KAvg volum

The Motley FoolLoading...0
Yonsei University Researchers Develop Mamba State-Space Neural Decoder to Enable Real-Time Quantum Error Correction
Featured
quantum-computing

Yonsei University Researchers Develop Mamba State-Space Neural Decoder to Enable Real-Time Quantum Error Correction

The neural decoder comprises a stabilizer embedder, a recurrent core, a syndrome mixer, and a readout network. Researchers from Yonsei University have developed a neural quantum error correction (QEC) decoder based on the Mamba structured state-space architecture, reducing the computational complexity of deep-learning decoding from O(d4) to O(d2) in code distance d. In peer-reviewed research published in npj Quantum Information, the team demonstrated that the state-space model matches the accuracy of Transformer-based models such as AlphaQubit on experimental memory benchmarks while eliminating the quadratic self-attention bottlenecks that prevent real-time feedback on physical quantum hardware. State-Space Syndrome Processing and Real-Time Decoding Metrics In planar surface codes, syndrome extraction generates sequences scaling with the number of stabilizers (Nstab = d2 − 1). Standard Transformer neural decoders utilize multi-head self-attention mechanisms that perform pairwise comparisons between all stabilizer tokens, yielding an O(d4) scaling that accumulates latency backlogs well beyond microsecond superconducting coherence limits. The Mamba decoder replaces explicit multi-head attention with selective state-space layers, utilizing input-dependent linear scans to maintain historical syndrome contexts within compressed hidden states. Evaluated on the Google Quantum AI Sycamore hardware dataset, the state-space architecture matched Transformer accuracy in static memory benchmarks and maintained an error-suppression advantage when accounting for decoder-induced latency noise. Decoding Performance and Scaling Metrics across Surface Code BenchmarksEvaluation MetricMamba DecoderTransformer Decoder (AlphaQubit Baseline)Core Computational ComplexityO(d2) (Linear in syndrome tokens)O(d4) (Quadratic pairwise self-attention)Sycamore Memory LER (d = 3)2.981 × 10−2∼ 2.98 × 10−2Sycamore Memory LER (d = 5)2.916 × 10−2∼ 2.91 × 10−2Real-Time LER at d = 9 (With Latency Noise)1.5

Quantum Computing ReportLoading...0
Nord Quantique Secures $10 Million DARPA Quantum Benchmarking Initiative Stage B Agreement Extensionquantum-computing

Nord Quantique Secures $10 Million DARPA Quantum Benchmarking Initiative Stage B Agreement Extension

Nord Quantique has secured a $10 million agreement extension under Stage B of the Defense Advanced Research Projects Agency (DARPA) Quantum Benchmarking Initiative (QBI), building on its earlier selection when DARPA advanced eleven teams to Stage B. The award finances ongoing engineering milestones and physical risk-mitigation prototyping for the company’s bosonic quantum error correction (QEC) architecture. DARPA’s QBI program is structured to evaluate whether emerging quantum computing hardware platforms can achieve utility-scale operational performance—defined as computational utility exceeding implementation cost—by 2033 through rigorous independent verification and validation (IV&V) metrics. Superconducting Bosonic Codes and Hardware-Level Fault-Tolerance Benchmarks Unlike conventional discrete-variable solid-state architectures that require hundreds or thousands of physical transmons to assemble a single fault-tolerant logical qubit via surface or LDPC codes, Nord Quantique employs continuous-variable bosonic codes embedded in superconducting microwave cavities. As detailed in previous technical evaluations of Nord Quantique’s GKP reservoir engineering, the architecture encodes quantum information into multiphoton states to implement active error correction directly at the physical layer, targeting an effective 1:1 physical-to-logical footprint. Under Stage B of the DARPA protocol, performers must deliver comprehensive research and development execution plans, identify dominant decoherence channels—including photon loss and phase-space diffusion—and demonstrate prototype hardware subsystems that actively reduce state preparation and measurement (SPAM) and gate error rates below fault-tolerant thresholds. DARPA QBI Program Structure and Nord Quantique Evaluation ScopeProgram StageFunding & Award ParametersTechnical Mandate & Verification MilestonesStage A (Feasibility)Awards up to $1 MillionInitial conceptual system design and theoretical derivation

Quantum Computing ReportLoading...0
Certified bounds on optimization problems in quantum theoryquantum-computing

Certified bounds on optimization problems in quantum theory

AbstractSemidefinite relaxations of polynomial optimization have become a central tool for addressing the non-convex optimization problems over non-commutative operators that are ubiquitous in quantum information theory and, more in general, quantum physics. Yet, as these global relaxation methods are solved numerically, the bounds issued by the semidefinite solver can – and often do – exceed the global optimum, undermining their certifiability. To counter this issue, we introduce a framework for extracting rigorous certified bounds on non-commutative optimization problems from inexact numerical data, and apply it to several paradigmatic problems in quantum information theory. An extension to sparsity and symmetry-adapted semidefinite relaxations is also provided and compared to the general dense scheme. Our results establish rational post-processing as a practical route to reliable certification, pushing semidefinite optimization toward a certifiable standard for quantum information science.Popular summaryHow strongly can quantum behavior differ from classical behavior? What properties can a quantum system have at its lowest energy? Answering such questions often requires finding bounds on what quantum physics allows. Powerful numerical optimization methods can estimate these bounds, but numerical methods work with finite precision and might yield invalidated bounds. We introduce a practical method for turning numerical bounds on polynomial quantum optimization problems into mathematically exact certificates. Starting from an approximate solution, we enforce the required algebraic relations in exact arithmetic, and establish the exact certificate from the numerical one. The resulting certificate establishes a certified bound that can be checked using exact arithmetic. We demonstrate the method on Bell inequalities and ground-state observables of quantum many-body systems, and extend it to calculations that exploit sparsity and symmetry. Our methods help bridge the

Quantum JournalLoading...0
DataBrushing.AI Launches UEChain for Data Verification and Trustquantum-computing

DataBrushing.AI Launches UEChain for Data Verification and Trust

DataBrushing.AI Launches UEChain for Data Verification and Trust Mohib Ur Rehman October 28, 2026 Industry News Insider Brief DataBrushing.AI has launched UEChain, a trusted data platform that uses public key infrastructure (PKI), digital certificates, cryptographic signatures and timestamps to support data provenance and evidence verification. The platform supports conventional, hybrid and post-quantum cryptography, with APIs and SDKs for certificate verification and long-term evidence preservation. DataBrushing.AI has signed MOUs with four Taiwanese academic, research and cybersecurity organizations to explore applications including marine data protection, AI-era cyber defense and cross-institutional data security. PRESS RELEASE — AI DataBrushing Technology Co., Ltd. (DataBrushing.AI) launched S.A.F.E.-AI Trusted Platform – UEChain on October 16, a solution built on Public Key Infrastructure (PKI), a Certificate Authority (CA), and digital evidence chain technologies. UEChain is designed to help enterprises and research institutions answer three critical questions: Who provided the data? Has it been altered? And can its authenticity be independently verified? Guided by the principle “Turn Data into Evidence, Connect Evidence to Trust,” UEChain establishes an auditable trust mechanism across organization.s From Data Security to Verifiable Data Trust As generative AI, software supply chains, and cross-institutional data exchange become widespread, encryption alone cannot prove that a data source or version can be trusted. Without disclosing the original data, UEChain creates a cryptographic digest, digital signature, and timestamp for each record to preserve it as evidence, making that evidence fully traceable. PKI/CA and Secure Core: Building the Evidence Chain on Trusted IdentityUEChain uses X.509 digital certificates, public-key signatures, and certificate-chain validation to bind digital evidence to verifiable certificate identities, checking the chain of trust,

Quantum DailyLoading...0
Towards quantum computing Feynman diagrams in hybrid qubit-oscillator devicesquantum-computing

Towards quantum computing Feynman diagrams in hybrid qubit-oscillator devices

AbstractWe show that recent experiments in hybrid qubit-oscillator devices that measure the phase-space characteristic function of the oscillator via the qubit can be seen through the lens of functional calculus and path integrals, drawing a clear analogy with the generating functional of a quantum field theory. This connection suggests an expansion of the characteristic function in terms of Feynman diagrams, exposing the role of the real-time bosonic propagator, and identifying the external source functions with certain time-dependent couplings that can be controlled experimentally. By applying maximum-likelihood techniques, we show that the “measurement'' of these Feynman diagrams can be reformulated as a problem of multi-parameter point estimation that takes as input a set of Ramsey-type measurements of the qubit. By numerical simulations that consider leading imperfections in trapped-ion devices, we identify the optimal regimes in which Feynman diagrams could be reconstructed from measured data with low systematic and stochastic errors. We discuss how these ideas can be generalized to finite temperatures via the Schwinger-Keldysh formalism, contributing to a bottom-up approach to probe quantum simulators of lattice field theories by systematically increasing the qubit-oscillator number.Popular summaryFeynman diagrams are one of the most iconic tools in modern physics: simple drawings that encode how quantum particles propagate and interact. But could we actually measure these diagrams in a quantum experiment, rather than only calculate them on paper? In this work, we show how this could be done in a toy model that uses hybrid quantum systems, where a qubit acts as a probe of a quantum oscillator. Through a Ramsey-type experiment, information about the oscillator’s quantum dynamics is imprinted onto the qubit. From repeated measurements, individual contributions associated with Feynman diagrams can then be reconstructed using statistical inference. Using realisti

Quantum JournalLoading...0
Qarakal Quantum And Quantum Elements Receive BIRD Foundation Grant For Quantum Computing Innovation With a $2.4 Million Budgetquantum-computing

Qarakal Quantum And Quantum Elements Receive BIRD Foundation Grant For Quantum Computing Innovation With a $2.4 Million Budget

 Qarakal Quantum And Quantum Elements Receive BIRD Foundation Grant For Quantum Computing Innovation With a $2.4 Million Budget Matt Swayne October 28, 2026 Industry News Insider Brief Quantum Elements and Qarakal Quantum were selected by the BIRD Foundation for a $2.4 million project to develop a quantum simulation platform for chemical reactions on material surfaces. The collaboration will combine Qarakal’s superconducting quantum hardware with Quantum Elements’ digital-twin software and error-management tools to jointly optimize hardware and chemistry workflows. The companies aim to build a validated prototype, benchmark chemistry models and quantum algorithms to investigate how quantum computing could complement existing catalyst simulation methods. PRESS RELEASE — Quantum Elements and Qarakal Quantum today announced they have been selected by the Israel-U.S. Binational Industrial Research and Development (BIRD) Foundation to jointly develop a quantum simulation platform for understanding and designing the chemical reactions that occur on material surfaces. The project, one of seven approved by the BIRD Foundation, has a budget of $2.4 million. The project will combine Qarakal Quantum’s modular superconducting quantum hardware and hardware-software co-design approach with Quantum Elements’ software for advancing fault-tolerant quantum computing, using AI-driven co-design, error suppression, error correction and decoders.  Together, the companies will work toward a validated prototype capable of taking industrially relevant catalyst problems and turning them into quantum-ready computational workflows. Heterogeneous catalysis is essential to industries ranging from energy and chemicals to advanced materials, with catalytic processes involved in the manufacture of an estimated 80–90% of chemical products. The scale of these industries is significant — according to a MarketLine study, the global chemical processing industry generates between $5 and $6 tril

Quantum DailyLoading...0
A new ranking of tests reveals how well they find entanglementquantum-computing

A new ranking of tests reveals how well they find entanglement

Akhil Kumar Awasthi of Harish-Chandra Research Institute and colleagues have established a performance ranking for tests designed to identify entanglement in quantum systems. Their work analyzes entropy-based, majorization, realignment and reduction criteria for detecting entanglement in random states, considering both the rank of the states and the size of the quantum subsystems involved. The researchers demonstrate that the realignment criterion is particularly effective when the dimensions of those subsystems are nearly equal, and they’ve proven lower bounds on the rank of quantum states beyond which realignment and entropic criteria will fail to detect entanglement. These results offer insights into the thresholds needed for reliable entanglement detection as complexity increases. Entanglement Detection Hierarchy for Random High-Dimensional States This limitation is particularly relevant when analyzing high-rank entangled states within complex, high-dimensional systems, revealing inherent difficulties in identifying entanglement as dimensionality increases. Evaluations of detection method effectiveness relied on three key indicators: the fraction of detected states, the mean detectable entanglement and the minimum required entanglement for successful identification. Numerical simulations were conducted on random states in 2⊗d systems, where d exceeds three, and states in d1⊗d2 systems, with d1 and d2 greater than or equal to three, to better understand the behavior of entanglement detection methods. The realignment criterion exhibits greater efficiency than other detection methods when the difference between subsystem dimensions is small, a detailed finding that highlights the importance of system asymmetry. This observation indicates that the optimal detection strategy is not universal, and depends on the specific configuration of the quantum system under investigation. For full-rank states, the reduction criteria alone can identify some NPT entangled states, w

Quantum ZeitgeistLoading...0