Dense Quantum Measurement Theory

Abstract

Quantum measurement is a fundamental cornerstone of experimental quantum computations. The main issues in current quantum measurement strategies are the high number of measurement rounds to determine a global optimal measurement output and the low success probability of finding a global optimal measurement output. Each measurement round requires preparing the quantum system and applying quantum operations and measurements with high-precision control in the physical layer. These issues result in extremely high-cost measurements with a low probability of success at the end of the measurement rounds. Here, we define a novel measurement for quantum computations called dense quantum measurement. The dense measurement strategy aims at fixing the main drawbacks of standard quantum measurements by achieving a significant reduction in the number of necessary measurement rounds and by radically improving the success probabilities of finding global optimal outputs. We provide application scenarios for quantum circuits with arbitrary unitary sequences, and prove that dense measurement theory provides an experimentally implementable solution for gate-model quantum computer architectures.

Training Optimization for Gate-Model Quantum Neural Networks

“…A theoretical background on the realizations of quantum computations in a gate-model quantum computer environment can be found in [13] and [14]. For a summary on the related references [1-3, 13-16, 20, 21], we suggest [22].…”

Routing space exploration for scalable routing in the quantum Internet

“…Using the results of Algorithm 2 for determining the service rates of paths, the neighbouring quantum repeaters can be selected from each quantum repeater to establish scalable routing. The routing scaling algorithm uses the path service rate information to find the entangled path P * with the highest weighted service rate W A→B , and uses R d deterministic routing if the service rate degradation coefficient ξ R i , R j [see (40)] between a particular source and destination quantum repeater in P * is below a critical threshold value ∂S * ; otherwise, it uses R a adaptive routing between the quantum nodes.…”

“…Quantum information and quantum computations [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19] will not only reformulate our view of the nature of computation and communication, but will also open new possibilities for realizing high-performance computer architectures and telecommunication networks [10][11][12][13][14][15][16][17][28][29][30][31][33][34][35][36][37][38][39][40][41][42][43][44][45][62][63][64][65][66][67]…”

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.…”