Optimizing High-Efficiency Quantum Memory with Quantum Machine Learning for Near-Term Quantum Devices

Abstract

Quantum memories are a fundamental of any global-scale quantum Internet, high-performance quantum networking and near-term quantum computers. A main problem of quantum memories is the low retrieval efficiency of the quantum systems from the quantum registers of the quantum memory. Here, we define a novel quantum memory called high-retrieval-efficiency (HRE) quantum memory for near-term quantum devices. An HRE quantum memory unit integrates local unitary operations on its hardware level for the optimization of the readout procedure and utilizes the advanced techniques of quantum machine learning. We define the integrated unitary operations of an HRE quantum memory, prove the learning procedure, and evaluate the achievable output signal-to-noise ratio values. We prove that the local unitaries of an HRE quantum memory achieve the optimization of the readout procedure in an unsupervised manner without the use of any labeled data or training sequences. We show that the readout procedure of an HRE quantum memory is realized in a completely blind manner without any information about the input quantum system or about the unknown quantum operation of the quantum register. We evaluate the retrieval efficiency of an HRE quantum memory and the output SNR (signalto-noise ratio). The results are particularly convenient for gate-model quantum computers and the near-term quantum devices of the quantum Internet.1. We define a novel quantum memory called high-retrieval-efficiency (HRE) quantum memory.2. An HRE quantum memory unit integrates local unitary operations on its hardware level for the optimization of the readout procedure and utilizes the advanced techniques of quantum machine learning.3. We define the integrated unitary operations of an HRE quantum memory, prove the learning procedure, and evaluate the achievable output signal-to-noise ratio values. We prove that local unitaries of an HRE quantum memory achieve the optimization of the readout procedure in an unsupervised manner without the use of any labeled data or training sequences.4. We evaluate the retrieval efficiency of an HRE quantum memory and the output SNR.5. The proposed results are convenient for gate-model quantum computers and near-term quantum devices.This paper is organized as follows. Section 2 defines the system model and the problem statement. Section 3 evaluates the integrated local unitary operations of an HRE quantum memory. Section 4 proposes the retrieval efficiency in terms of the achievable output SNR values. Finally, Section 5 concludes the results. Supplemental material is included in the Appendix.

Quantum State Optimization and Computational Pathway Evaluation for Gate-Model Quantum Computers

“…Since the map Γ in (16) has no inverse, finding Υ * in X from τ * defines an ill-posed problem [70,71,[76][77][78]. In this setting, the determination of Υ * from τ * , requires the use of a P projector on τ 0 (20) in H, which yields a P (τ 0 ) element in H. If τ * lies in (or close to) the span of {Γ (Υ i )}, where Υ i is an i-th training data, Υ i ∈ X , from a training set S X of N training data,…”

Decoherence dynamics estimation for superconducting gate-model quantum computers

“…The information processing network of a gate-model quantum computer uses traditionally uninterpretable phenomena such as quantum superposition or quantum entanglement [26][27][28][29][30][31][32][33][34][35][36]. The quantum computations are performed on some initial quantum states via a sequence of unitary operators [30,[37][38][39][40][41][42][43][44][45][46][47][48][49]. The unitary operators can formulate a larger unit called unitary block.…”

Quantum circuit optimization using quantum Karnaugh map

“…In quantum information science there has been significant effort directed towards various physical implementations of quantum bits and quantum circuits [1][2][3][4][5][6][7][8][9][10][11] . The efficient design of quantum circuits for processing quantum information is a fundamental problem in quantum algorithm design and quantum computation because qubits are very expensive resources [12][13][14][15][16][17][18][19][20][21][22] . This is especially important in the regime of quantum computation with limited number of qubits [13][14][15][16][17][18][19][20][21][22] .…”

“…The efficient design of quantum circuits for processing quantum information is a fundamental problem in quantum algorithm design and quantum computation because qubits are very expensive resources [12][13][14][15][16][17][18][19][20][21][22] . This is especially important in the regime of quantum computation with limited number of qubits [13][14][15][16][17][18][19][20][21][22] . More recent work [23][24][25][26][27][28][29][30] includes more fundamental quantum information theoretic aspects on quantum computations in relation to the previously mentioned queries.…”