Large-scale Quantum Computers Research Articles

Error-Tolerant Geometric Quantum Control for Logical Qubits with Minimal Resources

Geometric quantum computation offers a practical strategy toward robust quantum computation due to its inherently error tolerance. However, the rigorous geometric conditions lead to complex and/or error-disturbed quantum controls, especially for logical qubits that involve more physical qubits, whose error tolerance is effective in principle though, their experimental demonstration is still demanding. Thus, how to best simplify the needed control and manifest its full advantage has become the key to widespread applications of geometric quantum computation. Here we propose a new fast and robust geometric scheme, with the decoherence-free-subspace encoding, and present its physical implementation on superconducting quantum circuits, where we only utilize the experimentally demonstrated parametrically tunable coupling to achieve high-fidelity geometric control over logical qubits. Numerical simulation verifies that it can efficiently combine the error tolerance from both the geometric phase and logical-qubit encoding, displaying our gate-performance superiority over the conventional dynamical one without encoding, in terms of both gate fidelity and robustness. Therefore, our scheme can consolidate both error suppression methods for logical-qubit control, which sheds light on the future large-scale quantum computation.

Fluxonium: An Alternative Qubit Platform for High-Fidelity Operations

Superconducting qubits provide a promising path toward building large-scale quantum computers. The simple and robust transmon qubit has been the leading platform, achieving multiple milestones. However, fault-tolerant quantum computing calls for qubit operations at error rates significantly lower than those exhibited in the state of the art. Consequently, alternative superconducting qubits with better error protection have attracted increasing interest. Among them, fluxonium is a particularly promising candidate, featuring large anharmonicity and long coherence times. Here, we engineer a fluxonium-based quantum processor that integrates high qubit coherence, fast frequency tunability, and individual-qubit addressability for reset, readout, and gates. With simple and fast gate schemes, we achieve an average single-qubit gate fidelity of 99.97% and a two-qubit gate fidelity of up to 99.72%. This performance is comparable to the highest values reported in the literature of superconducting circuits. Thus our work, within the realm of superconducting qubits, reveals an alternative qubit platform that is competitive with the transmon system.

Don’t Reject This: Key-Recovery Timing Attacks Due to Rejection-Sampling in HQC and BIKE

Well before large-scale quantum computers will be available, traditional cryptosystems must be transitioned to post-quantum (PQ) secure schemes. The NIST PQC competition aims to standardize suitable cryptographic schemes. Candidates are evaluated not only on their formal security strengths, but are also judged based on the security with regard to resistance against side-channel attacks. Although round 3 candidates have already been intensively vetted with regard to such attacks, one important attack vector has hitherto been missed: PQ schemes often rely on rejection sampling techniques to obtain pseudorandomness from a specific distribution. In this paper, we reveal that rejection sampling routines that are seeded with secretdependent information and leak timing information result in practical key recovery attacks in the code-based key encapsulation mechanisms HQC and BIKE.Both HQC and BIKE have been selected as alternate candidates in the third round of the NIST competition, which puts them on track for getting standardized separately o the finalists. They have already been specifically hardened with constant-time decoders to avoid side-channel attacks. However, in this paper, we show novel timing vulnerabilities in both schemes: (1) Our secret key recovery attack on HQC requiresonly approx. 866,000 idealized decapsulation timing oracle queries in the 128-bit security setting. It is structurally different from previously identified attacks on the scheme: Previously, exploitable side-channel leakages have been identified in the BCH decoder of a previously submitted HQC version, in the ciphertext check as well as in the pseudorandom function of the Fujisaki-Okamoto transformation. In contrast, our attack uses the fact that the rejection sampling routine invoked during the deterministic re-encryption of the decapsulation leaks secret-dependent timing information, which can be efficiently exploited to recover the secret key when HQC is instantiated with the (now constant-time) BCH decoder, as well as with the RMRS decoder of the current submission. (2) From the timing information of the constant weight word sampler in the BIKE decapsulation, we demonstrate how to distinguish whether the decoding step is successful or not, and how this distinguisher is then used in the framework of the GJS attack to derive the distance spectrum of the secret key, using 5.8 x 107 idealized timing oracle queries. We provide details and analyses of the fully implemented attacks, as well as a discussion on possible countermeasures and their limits.

Factoring semi-primes with (quantum) SAT-solvers

The computational difficulty of factoring large integers forms the basis of security for RSA public-key cryptography. The best-known factoring algorithms for classical computers run in sub-exponential time. The integer factorization problem can be reduced to the Boolean Satisfiability problem (SAT). While this reduction has proved to be useful for studying SAT solvers, large integers have not been factored via such a reduction. Shor’s quantum factoring algorithm factors integers in expected polynomial time. Large-scale fault-tolerant quantum computers capable of implementing Shor’s algorithm are not yet available, preventing relevant benchmarking experiments. Recently, several authors have attempted quantum factorizations via reductions to SAT or similar NP-hard problems. While this approach may shed light on algorithmic approaches for quantum solutions to NP-hard problems, in this paper we study and question its practicality. We find no evidence that this is a viable path toward factoring large numbers, even for scalable fault-tolerant quantum computers, as well as for various quantum annealing or other special purpose quantum hardware.

A Hash-Based Quantum-Resistant Designated Verifier Signature Scheme

Digital signatures are unsuitable for specific applications that are sensitive on a personal or commercial level because they are universally verifiable. Jakobsson et al. proposed the Designated Verifier Signature (DVS) system, which only allows the intended verifier to validate a message’s signature. It prohibits the disclosure of a conviction to a third party. This functionality is useful in applications that require both authenticity and signer privacy, such as electronic voting and tender calls. The vast majority of current DVS schemes are based on difficult number theory problems such as integer factorization or discrete log problems over various groups. The development of a large-scale quantum computer would render these schemes unsafe. As a result, it is critical to develop quantum-resistant DVS methods. In both quantum and classical computers, signatures based on one-way functions are more efficient and secure. They have several advantages over digital signatures based on trapdoor functions. As a result, hash-based signatures are now considered viable alternatives to number-theoretic signatures. Existing hash-based signatures, on the other hand, are easily verifiable by anyone. As a result, they do not protect the signer’s identity. In addition, they are one-time signatures. This paper presents a hash-based multi-time designated verifier signature scheme that ensures signer anonymity. The unforgeability of the signature scheme is also tested in the random oracle model under chosen message attack. The properties such as non-transferability and non-delegatability are investigated.

Flopping-Mode Electric Dipole Spin Resonance in Phosphorus Donor Qubits in Silicon

Single spin qubits based on phosphorus donors in silicon are a promising candidate for a large-scale quantum computer. Despite long coherence times, achieving uniform magnetic control remains a hurdle for scale-up due to challenges in high-frequency magnetic field control at the nanometre scale. Here, we present a proposal for a flopping-mode electric dipole spin resonance qubit based on the combined electron and nuclear spin states of a double phosphorus donor quantum dot. The key advantage of utilizing a donor-based system is that we can engineer the number of donor nuclei in each quantum dot. By creating multidonor dots with antiparallel nuclear spin states and multielectron occupation we can minimize the longitudinal magnetic field gradient, known to couple charge noise into the device and dephase the qubit. We describe the operation of the qubit and show that by minimizing the hyperfine interaction of the nuclear spins we can achieve $\ensuremath{\pi}/2\ensuremath{-}X$ gate error rates of about ${10}^{\ensuremath{-}4}$ using realistic noise models. We highlight that the low charge noise environment in these all-epitaxial phosphorus-doped silicon qubits will facilitate the realization of strong coupling of the qubit to superconducting microwave cavities, allowing for long-distance two-qubit operations.

Survey on Cryogenic CMOS Circuits for Quantum Computers

Nowadays, quantum computers are attracting much interest. In current quantum computers, measurement instruments, which provide functions of controlling and reading out quantum bits (qubits), operate under room temperature, and the instruments and qubits are connected by cables. This means that many cables are required for large-scale quantum computers, which could cause scalability issue. To reduce such cables, various CMOS LSIs operating at cryogenic temperature have been proposed for controlling and reading out qubits. In this paper, I briefly introduce characteristics of transistor and passive devices, such as resistors, capacitors, and inductors, at cryogenic temperature. Then, I review the latest research on cryogenic CMOS circuits for quantum computers.

The Qubit Fidelity Under Different Error Mechanisms Based on Error Correction Threshold

Quantum error correction is a crucial step to realize large-scale universal quantum computing, and the condition for realizing quantum error correction is that the error probability of each operation step must below some threshold. This requires that the qubits’ quality and the quantum gates precision can reach a certain level experimentally. We firstly discuss the mechanism of quantum errors: the precision of quantum gates corresponds to unitary operator errors, and the quality of qubits is attributed to decoherence. Then, according to the threshold of the surface code error correction, we proved the minimum of quantum gate fidelity should not be less than 1 − p with the error probability p, and found the natural decoherence time of qubits that can be used for error correction. This provides some kind of theoretical supports for qubits preparation and performing quantum operations experimentally.

On the nature of decoherence in quantum circuits: Revealing the structural motif of the surface radicals in α-Al2O3.

Quantum information technology puts stringent demands on the quality of materials and interfaces in the pursuit of increased device coherence. Yet, little is known about the chemical structure and origins of paramagnetic impurities that produce flux/charge noise that causes decoherence of fragile quantum states and impedes the progress toward large-scale quantum computing. Here, we perform high magnetic field electron paramagnetic resonance (HFEPR) and hyperfine multispin spectroscopy on α-Al2O3, a common substrate for quantum devices. In its amorphous form, α-Al2O3 is also unavoidably present in aluminum-based superconducting circuits and qubits. The detected paramagnetic centers are immanent to the surface and have a well-defined but highly complex structure that extends over multiple hydrogen, aluminum, and oxygen atoms. Modeling reveals that the radicals likely originate from well-known reactive oxygen chemistry common to many metal oxides. We discuss how EPR spectroscopy might benefit the search for surface passivation and decoherence mitigation strategies.

Search for Majorana neutrinos exploiting millikelvin cryogenics with CUORE

The possibility that neutrinos may be their own antiparticles, unique among the known fundamental particles, arises from the symmetric theory of fermions proposed by Ettore Majorana in 19371. Given the profound consequences of such Majorana neutrinos, among which is a potential explanation for the matter–antimatter asymmetry of the universe via leptogenesis2, the Majorana nature of neutrinos commands intense experimental scrutiny globally; one of the primary experimental probes is neutrinoless double beta (0νββ) decay. Here we show results from the search for 0νββ decay of 130Te, using the latest advanced cryogenic calorimeters with the CUORE experiment3. CUORE, operating just 10 millikelvin above absolute zero, has pushed the state of the art on three frontiers: the sheer mass held at such ultralow temperatures, operational longevity, and the low levels of ionizing radiation emanating from the cryogenic infrastructure. We find no evidence for 0νββ decay and set a lower bound of the process half-life as 2.2 × 1025 years at a 90 per cent credibility interval. We discuss potential applications of the advances made with CUORE to other fields such as direct dark matter, neutrino and nuclear physics searches and large-scale quantum computing, which can benefit from sustained operation of large payloads in a low-radioactivity, ultralow-temperature cryogenic environment.

A scalable helium gas cooling system for trapped-ion applications

Microfabricated ion-trap devices offer a promising pathway towards scalable quantum computing. Research efforts have begun to focus on the engineering challenges associated with developing large-scale ion-trap arrays and networks. However, increasing the size of the array and integrating on-chip electronics can drastically increase the power dissipation within the ion-trap chips. This leads to an increase in the operating temperature of the ion-trap and limits the device performance. Therefore, effective thermal management is an essential consideration for any large-scale architecture. Presented here is the development of a modular cooling system designed for use with multiple ion-trapping experiments simultaneously. The system includes an extensible cryostat that permits scaling of the cooling power to meet the demands of a large network. Following experimental testing on two independent ion-trap experiments, the cooling system is expected to deliver a net cooling power of 111 W at ∼70 K to up to four experiments. The cooling system is a step towards meeting the practical challenges of operating large-scale quantum computers with many qubits.

Analytical and experimental study of center-line miscalibrations in Mølmer-Sørensen gates

A major challenge for the realization of useful universal quantum computers is achieving high fidelity two-qubit entangling gate operations. However, calibration errors can affect the quantum gate operations and limit their fidelity. To reduce such errors it is desirable to have an analytical understanding and quantitative predictions of the effects that miscalibrations of gate parameters have on the gate performance. In this work, we study a systematic perturbative expansion in miscalibrated parameters of the M\o{}lmer-S\o{}rensen entangling gate, which is widely used in trapped-ion quantum processors. Our analytical treatment particularly focuses on systematic center-line detuning miscalibrations. Via a unitary Magnus expansion, we compute the gate evolution operator, which allows us to obtain relevant key properties such as relative phases, electronic populations, quantum state purity and fidelities. These quantities, subsequently, are used to assess the performance of the gate using the fidelity of entangled states as performance metric. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor. The method and the results presented here can help design and calibrate high-fidelity gate operations of large-scale quantum computers.

Research on Biological Population Evolutionary Algorithm and Individual Adaptive Method Based on Quantum Computing

On the basis of classical computer, quantum computer has been developed. In dealing with some large-scale parallel problems, quantum computer is simpler and faster than traditional computer. Nowadays, physical qubit computers have many limitations. Classical computers have many ways to simulate quantum computing, the most effective of which are quantum superiority and quantum algorithm. Ensuring computational efficiency, accuracy, and precision is of great significance to the study of large-scale quantum computing. Compared with other algorithms, genetic algorithm has more advantages, so it can be more widely used. For example, strong adaptability and global optimization ability are the advantages of genetic algorithm. Through the research in Chapter 4, we can conclude that the variance of A2C is obviously smaller than that of PPO. Furthermore, it can be concluded that A2C has better robustness.

Variational Quantum Simulation of Chemical Dynamics with Quantum Computers.

Classical simulations of real-space quantum dynamics are challenging due to the exponential scaling of computational cost with system dimensions. Quantum computers offer the potential to simulate quantum dynamics with polynomial complexity; however, existing quantum algorithms based on the split-operator techniques require large-scale fault-tolerant quantum computers that remain elusive in the near future. Here, we present variational simulations of real-space quantum dynamics suitable for implementation in noisy intermediate-scale quantum (NISQ) devices. The Hamiltonian is first encoded onto qubits using a discrete variable representation and binary encoding scheme. We show that direct application of a real-time variational quantum algorithm based on the McLachlan's principle is inefficient as the measurement cost grows exponentially with the qubit number for general potential energy, and an extremely small time-step size is required to achieve accurate results. Motivated by the insights that many chemical dynamics occur in the low-energy subspace, we propose a subspace expansion method by projecting the total Hamiltonian, including the time-dependent driving field, onto the system low-energy eigenstate subspace using quantum computers, and the exact quantum dynamics within the subspace can then be solved classically. We show that the measurement cost of the subspace approach grows polynomially with dimensionality for general potential energy. Our numerical examples demonstrate the capability of our approach, even under intense laser fields. Our work opens the possibility of simulating chemical dynamics with NISQ hardware.

Quantum simulation of quantum field theory in the light-front formulation

Quantum chromodynamics (QCD) describes the structure of hadrons such as the proton at a fundamental level. The precision of calculations in QCD limits the precision of the values of many physical parameters extracted from collider data. For example, uncertainty in the parton distribution function (PDF) is the dominant source of error in the $W$ mass measurement at the LHC. Improving the precision of such measurements is essential in the search for new physics. Quantum simulation offers an efficient way of studying quantum field theories (QFTs) such as QCD non-perturbatively. Previous quantum algorithms for simulating QFTs have qubit requirements that are well beyond the most ambitious experimental proposals for large-scale quantum computers. Can the qubit requirements for such algorithms be brought into range of quantum computation with several thousand logical qubits? We show how this can be achieved by using the light-front formulation of quantum field theory. This work was inspired by the similarity of the light-front formulation to quantum chemistry, first noted by Kenneth Wilson.

A programmable qudit-based quantum processor

Controlling and programming quantum devices to process quantum information by the unit of quantum dit, i.e., qudit, provides the possibilities for noise-resilient quantum communications, delicate quantum molecular simulations, and efficient quantum computations, showing great potential to enhance the capabilities of qubit-based quantum technologies. Here, we report a programmable qudit-based quantum processor in silicon-photonic integrated circuits and demonstrate its enhancement of quantum computational parallelism. The processor monolithically integrates all the key functionalities and capabilities of initialisation, manipulation, and measurement of the two quantum quart (ququart) states and multi-value quantum-controlled logic gates with high-level fidelities. By reprogramming the configuration of the processor, we implemented the most basic quantum Fourier transform algorithms, all in quaternary, to benchmark the enhancement of quantum parallelism using qudits, which include generalised Deutsch-Jozsa and Bernstein-Vazirani algorithms, quaternary phase estimation and fast factorization algorithms. The monolithic integration and high programmability have allowed the implementations of more than one million high-fidelity preparations, operations and projections of qudit states in the processor. Our work shows an integrated photonic quantum technology for qudit-based quantum computing with enhanced capacity, accuracy, and efficiency, which could lead to the acceleration of building a large-scale quantum computer.

Quantum Computing and Computed Tomography: A Roadmap towards QuantumCT

Quantum computing (QC) is considered as a rising star of computing technologies with very promising possibilities towards novel solutions of even more complex computing tasks than those which are tackled using today’s supercomputers. However, direct use in everyday applications is lacking both: large scale quantum computers and quantum algorithms, i.e. software. We are carrying out the first project on a road towards QC enabled Computed Tomography (CT). In our paper we present this project after its first out of five years duration and share the first steps we made with the community. It is worth to mention that the hardware for QC is still in a phase of development, which implies that most of the software research is in a phase of becoming ready for productional use cases.

16 x 8 quantum dot array operation at cryogenic temperatures

We developed a 16 x 8 quantum dot array and CMOS circuit hybrid chip (Q-CMOS). By optimizing the transistor design of Q-CMOS formed by fully depleted (FD)-SOI, it is possible to selectively control each of 16 x 8 quantum dots, and obtained characteristics of quantum dot variation for the first time. Due to the mesoscopic effect, the variation in the characteristics of the quantum dots is larger than the threshold voltage variation of the transistors. Thus, we have obtained an important finding that it is necessary to suppress the variability in order to realize a large-scale quantum computer. We have also confirmed that the characteristics of the quantum dots change depending on the applied gate voltages.

Highly Vectorized SIKE for AVX-512

It is generally accepted that a large-scale quantum computer would be capable to break any public-key cryptosystem used today, thereby posing a serious threat to the security of the Internet’s public-key infrastructure. The US National Institute of Standards and Technology (NIST) addresses this threat with an open process for the standardization of quantum-safe key establishment and signature schemes, which is now in the final phase of the evaluation of candidates. SIKE (an abbreviation of Supersingular Isogeny Key Encapsulation) is one of the alternate candidates under evaluation and distinguishes itself from other candidates due to relatively short key lengths and relatively high computing costs. In this paper, we analyze how the latest generation of Intel’s Advanced Vector Extensions (AVX), in particular AVX-512IFMA, can be used to minimize the latency (resp. maximize the hroughput) of the SIKE key encapsulation mechanism when executed on Ice Lake CPUs based on the Sunny Cove microarchitecture. We present various techniques to parallelize and speed up the base/extension field arithmetic, point arithmetic, and isogeny computations performed by SIKE. All these parallel processing techniques are combined in AvxSike, a highly optimized implementation of SIKE using Intel AVX-512IFMA instructions. Our experiments indicate that AvxSike instantiated with the SIKEp503 parameter set is approximately 1.5 times faster than the to-date best AVX-512IFMA-based SIKE software from the literature. When executed on an Intel Core i3-1005G1 CPU, AvxSike outperforms the x64 assembly implementation of SIKE contained in Microsoft’s SIDHv3.4 library by a factor of about 2.5 for key generation and decapsulation, while the encapsulation is even 3.2 times faster.

The Race for Quantum-Resistant Cryptography [quantum - cyber security

That large-scale universal quantum computers could break widely used encryption methods is well known, but what was once seen as a distant, even theoretical, problem is now driving the latest technology race. Current developments in advanced quantum cryptographic solutions are discussed, including the use of public and private/secret keys, random number generation (RNG), quantum key distribution (QKD), QuantumCloud and chip-based quantum cryptography communication systems along with protocols and security/trustless computing issues. Some possible applications such as quantum-resistant communication systems for defence aircraft/drones, blockchain, Internet of Things (IoT) and smart city are mentioned. Particular focus is given to satellite-based QKD software architecture and QKD over optical fibre, along with appropriate standards, allowing over globe-spanning distances, to achieve end-to-end secure communication.