• Corpus ID: 231839839

Effects of quantum resources on the statistical complexity of quantum circuits

@article{Bu2021EffectsOQ,
  title={Effects of quantum resources on the statistical complexity of quantum circuits},
  author={Kaifeng Bu and Dax Enshan Koh and Lu Li and Qingxian Luo and Yaobo Zhang},
  journal={ArXiv},
  year={2021},
  volume={abs/2102.03282}
}
Kaifeng Bu,1, ∗ Dax Enshan Koh,2, † Lu Li,3, 4 Qingxian Luo,4, 5 and Yaobo Zhang6, 7 1Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA 2Institute of High Performance Computing, Agency for Science, Technology and Research (A*STAR), 1 Fusionopolis Way, #16-16 Connexis, Singapore 138632, Singapore 3Department of Mathematics, Zhejiang Sci-Tech University, Hangzhou, Zhejiang 310018, China 4School of Mathematical Sciences, Zhejiang University, Hangzhou, Zhejiang 310027… 

Figures from this paper

Rademacher complexity of noisy quantum circuits

Kaifeng Bu,1, ∗ Dax Enshan Koh,2, † Lu Li,3, 4 Qingxian Luo,4, 5 and Yaobo Zhang6, 7 1Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA 2Institute of High Performance

Complexity of quantum circuits via sensitivity, magic, and coherence

This work defines the set of unitaries with vanishing sensitivity and shows that it coincides with the family of matchgates, and proves that sensitivity is necessary for a quantum speedup.

Encoding-dependent generalization bounds for parametrized quantum circuits

These results facilitate the selection of optimal data-encoding strategies via structural risk minimization, a mathematically rigorous framework for model selection, by bounding the complexity of PQC-based models as measured by the Rademacher complexity and the metric entropy, two complexity measures from statistical learning theory.

Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix

Learning about physical systems from quantum-enhanced experiments, relying on a quantum memory and quantum processing, can outperform learning from experiments in which only classical memory and

Accelerating variational quantum algorithms with multiple quantum processors

An efficient distributed optimization scheme, called QUDIO, that can be readily mixed with other advanced VQAs-based techniques to narrow the gap between the state of the art and applications with quantum advantage.

Learning bounds for quantum circuits in the agnostic setting

This paper investigates the learnability of some hypothesis sets for regression and binary classification defined by quantum circuits and compares the current bounds with others found in the literature and discusses their implications for classification and regression on quantum data.

Structural risk minimization for quantum linear classifiers

This paper proves that two model parameters closely control the models' complexity and therefore its generalization performance, and gives rise to new options for structural risk minimization for QML models.

Generalization in quantum machine learning from few training data

This work provides a comprehensive study of generalization performance in QML after training on a limited number N of training data points, and reports rigorous bounds on the generalisation error in variational QML, confirming how known implementable models generalize well from an efficient amount ofTraining data.

References

SHOWING 1-10 OF 60 REFERENCES

On the statistical complexity of quantum circuits

This paper presents a parallel version of the Celada–Seiden cellular automaton that combines the efforts of two parallel systems, called Celada and Shannon, to solve the inequality in theorems of LaSalle’s inequality.

The resource theory of stabilizer quantum computation

A resource theory, analogous to the theory of entanglement, is developed that is relevant for fault-tolerant stabilizer computation and introduces two quantitative measures for the amount of non-stabilizer resource, including the sum of the negative entries of the discrete Wigner representation of a quantum state.

Quantum resource theories

Quantum resource theories (QRTs) offer a highly versatile and powerful framework for studying different phenomena in quantum physics. From quantum entanglement to quantum computation, resource

Matchgates and classical simulation of quantum circuits

  • R. JozsaA. Miyake
  • Physics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2008
Let G(A, B) denote the two-qubit gate that acts as the one-qubit SU(2) gates A and B in the even and odd parity subspaces, respectively, of two qubits. Using a Clifford algebra formalism, we show

Quantifying the magic of quantum channels

A resource theory for magic quantum channels is developed to characterize and quantify the quantum ‘magic’ or non-stabilizerness of noisy quantum circuits, and two efficiently computable magic measures for quantum channels are introduced.

The Heisenberg Representation of Quantum Computers

Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features

Trainability of Dissipative Perceptron-Based Quantum Neural Networks

This work represents the first rigorous analysis of the scalability of a perceptron-based QNN and provides quantitative bounds on the scaling of the gradient for DQNNs under different conditions, such as different cost functions and circuit depths.

Improved Simulation of Stabilizer Circuits

The Gottesman-Knill theorem, which says that a stabilizer circuit, a quantum circuit consisting solely of controlled-NOT, Hadamard, and phase gates can be simulated efficiently on a classical computer, is improved in several directions.

Colloquium: quantum coherence as a resource

The coherent superposition of states, in combination with the quantization of observables, represents one of the most fundamental features that mark the departure of quantum mechanics from the

Generalized Unitary Coupled Cluster Wave functions for Quantum Computation.

We introduce a unitary coupled-cluster (UCC) ansatz termed k-UpCCGSD that is based on a family of sparse generalized doubles operators, which provides an affordable and systematically improvable
...