IEEE Spectrum

A crowd of quantum entanglements

Saswato R. Das

Published Feb 24, 2011• 2 citations

Abstract

In a flurry of research reports during the past six months, physicists have proven that silicon, the basis of computers today, could also be the best platform for tomorrow's quantum computers.

DOI: 10.1109/mspec.2011.5719710

Related papers

Progress Towards a Revolutionary Quantum Computer in Silicon

L. Oberbeck, S. Prawer, Andrew S. Dzurak +28 more

Jan 1, 20020 citations

Algorithm-oriented qubit mapping for variational quantum algorithms

Yanjun Ji, Xi Chen, Ilia Polian +1 more

Variational algorithms are among the first practical applications of quantum computing, but their performance is limited by today's noisy intermediate-scale quantum (NISQ) devices. The authors propose scalable, depth-optimal solutions to overcome these limitations by integrating optimal mapping algorithms applied to small submodules of a given NISQ computer (focusing on popular linear and T- and H-shaped subtopologies). Identification of the best qubits combined with postselection keeps the error rate in check. The team reports up to 82% reduction in circuit depth and an average of 138% better success probability, thus paving the way for reliable quantum computing ecosystems of tomorrow.

arXiv:2310.09826Physical Review AppliedMar 11, 202512 citations

Current Status and Future Perspective of Silicon Quantum Computers

Kohei M. Itoh

The Japan Society of Applied PhysicsJul 8, 20140 citations

5 Questions: Scott Best: Prepping Today's Systems for Tomorrow's Post-Quantum Cryptography

Rahul Rao

Today's cryptographic protocols rely on mathematical techniques like finding the prime factors of very large numbers. But large enough quantum computers would have a powerful tool called Shor's algorithm, which can quickly factor colossal integers.

IEEE SpectrumJul 1, 20240 citations

Off-line quantum-advantage feature extraction for industrial production

Carlos Flores-Garrigos, Gabriel D. Alvarado Barrios, Qi Zhang +2 more

Quantum computing is no longer a lab curiosity for academic research. Industrial processors exceeding 100 qubits are commercially accessible and, for the first time, can extract information from data in ways that classical algorithms struggle to match. The most direct way to monetize this capability for industrial production today is quantum feature extraction: turning raw business data (images, customer records, molecules, or sensor readings) into richer representations that outperform standard machine learning models. There is one obstacle, however, that stands between today's demonstrations and tomorrow's production systems: every sample of data costs a quantum computing execution. For a company with millions of customers, satellite images, or transactions per month, processing every sample on quantum hardware is simply not viable. This work introduces quantum feature surrogates, a framework developed by Kipu Quantum that breaks this bottleneck. The idea is intuitive though challenging: instead of asking the quantum computer to look at every single sample, we let it look at a small, carefully chosen subsample of the data, whose distribution faithfully represents the full set. A simple classical model, a surrogate, then learns the quantum-induced patterns and applies them to the rest of the dataset at near-zero cost. The quantum processor stops being a per-sample engine and becomes a teacher of representations, while production inference runs entirely on classical hardware.

quant-pharXiv:2605.19801May 20, 20260 citations

The Quantum Cookbook: Recipes for Programming Real Qubits

Gerald Enrique Nelson Mc Kenzie

The Quantum Cookbook: Recipes for Programming Real Qubits is a hands-on programming book that teaches working engineers how to write and run real quantum circuits on real quantum hardware. Organized as 19 recipes that build on each other — from a first "Hello, Qubit" circuit through entanglement (Bell and GHZ states), quantum teleportation, superdense coding, Grover's search, the Quantum Fourier Transform and Shor's algorithm, VQE, and QAOA — the book treats quantum programming the way a culinary cookbook treats cooking: each recipe lists its ingredients (qubits, gates, classical bits), walks through the method step by step, shows the code in two languages side by side, and ends with tasting notes on what the result means. Every recipe is presented in both Qiskit (IBM's Python SDK) and OpenQASM 3.0 (the standardized assembly-level language), and runs on the IBM Quantum Platform via the SamplerV2 and EstimatorV2 primitives, with 10 minutes of free real-hardware time per month on the Open Plan. Unlike a traditional textbook, the book assumes the reader is an engineer, not a physicist, and grounds every concept in runnable code: qubits as 2-dimensional complex vectors, gates as unitary matrices, and multi-qubit states as tensor products are the four math tools the recipes use and nothing more. A math primer, API reference, OpenQASM 3.0 reference, glossary, and citation appendix support the recipes, while dedicated chapters on error mitigation, logical qubits and the fault-tolerance roadmap, and the state of the field in 2026 keep the focus firmly on what runs on a real QPU today and what will run on one tomorrow. Released under the Apache 2.0 License (DOI: 10.5281/zenodo.21863658), it is written for anyone who wants to move past toy simulators and start programming real qubits.

Aug 9, 20260 citations