Variational Quantum Optimization of Nonlocality in Noisy Quantum
Networks
- URL: http://arxiv.org/abs/2205.02891v1
- Date: Thu, 5 May 2022 19:02:37 GMT
- Title: Variational Quantum Optimization of Nonlocality in Noisy Quantum
Networks
- Authors: Brian Doolittle, Tom Bromley, Nathan Killoran, Eric Chitambar
- Abstract summary: We develop a variational quantum optimization framework that simulates quantum networks on quantum hardware.
We use our hybrid framework to optimize nonlocality in noisy quantum networks.
In the long-term, our variational quantum optimization techniques show promise of scaling beyond classical approaches.
- Score: 3.7468898363447654
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The inherent noise and complexity of quantum communication networks leads to
challenges in designing quantum network protocols using classical methods. To
address this issue, we develop a variational quantum optimization framework
that simulates quantum networks on quantum hardware and optimizes the network
using differential programming techniques. We use our hybrid framework to
optimize nonlocality in noisy quantum networks. On the noisy IBM quantum
computers, we demonstrate our framework's ability to maximize quantum
nonlocality. On a classical simulator with a static noise model, we investigate
the noise robustness of quantum nonlocality with respect to unital and
nonunital channels. In both cases, we find that our optimization methods can
reproduce known results, while uncovering interesting phenomena. When unital
noise is present we find numerical evidence suggesting that maximally entangled
state preparations yield maximal nonlocality. When nonunital noise is present
we find that nonmaximally entangled states can yield maximal nonlocality. Thus,
we show that variational quantum optimization is a practical design tool for
quantum networks in the near-term. In the long-term, our variational quantum
optimization techniques show promise of scaling beyond classical approaches and
can be deployed on quantum network hardware to optimize quantum communication
protocols against their inherent noise.
Related papers
- A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - On-the-fly Tailoring towards a Rational Ansatz Design for Digital
Quantum Simulations [0.0]
It is imperative to develop low depth quantum circuits that are physically realizable in quantum devices.
We develop a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz.
The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening.
arXiv Detail & Related papers (2023-02-07T11:22:01Z) - Quantum Neural Architecture Search with Quantum Circuits Metric and
Bayesian Optimization [2.20200533591633]
We propose a new quantum gates distance that characterizes the gates' action over every quantum state.
Our approach significantly outperforms the benchmark on three empirical quantum machine learning problems.
arXiv Detail & Related papers (2022-06-28T16:23:24Z) - Quantum Robustness Verification: A Hybrid Quantum-Classical Neural
Network Certification Algorithm [1.439946676159516]
In this work, we investigate the verification of ReLU networks, which involves solving a robustness many-variable mixed-integer programs (MIPs)
To alleviate this issue, we propose to use QC for neural network verification and introduce a hybrid quantum procedure to compute provable certificates.
We show that, in a simulated environment, our certificate is sound, and provide bounds on the minimum number of qubits necessary to approximate the problem.
arXiv Detail & Related papers (2022-05-02T13:23:56Z) - Feasible Architecture for Quantum Fully Convolutional Networks [4.849886707973093]
We propose a feasible pure quantum architecture that can be operated on noisy intermediate-scale quantum devices.
Our study represents the successful training of a pure quantum fully convolutional network and discusses advantages by comparing it with the hybrid solution.
arXiv Detail & Related papers (2021-10-05T01:06:54Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - Entanglement Rate Optimization in Heterogeneous Quantum Communication
Networks [79.8886946157912]
Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond.
Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware.
In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
arXiv Detail & Related papers (2021-05-30T11:34:23Z) - Entangling Quantum Generative Adversarial Networks [53.25397072813582]
We propose a new type of architecture for quantum generative adversarial networks (entangling quantum GAN, EQ-GAN)
We show that EQ-GAN has additional robustness against coherent errors and demonstrate the effectiveness of EQ-GAN experimentally in a Google Sycamore superconducting quantum processor.
arXiv Detail & Related papers (2021-04-30T20:38:41Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z) - Limitations of optimization algorithms on noisy quantum devices [0.0]
We present a transparent way of comparing classical algorithms to quantum ones running on near-term quantum devices.
Our approach is based on the combination of entropic inequalities that determine how fast the quantum state converges to the fixed point of the noise model.
arXiv Detail & Related papers (2020-09-11T17:07:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.