Treespilation: Architecture- and State-Optimised Fermion-to-Qubit
Mappings
- URL: http://arxiv.org/abs/2403.03992v2
- Date: Fri, 8 Mar 2024 10:14:07 GMT
- Title: Treespilation: Architecture- and State-Optimised Fermion-to-Qubit
Mappings
- Authors: Aaron Miller and Adam Glos and Zolt\'an Zimbor\'as
- Abstract summary: We introduce "treespilation," a technique for efficiently mapping Fermionic systems.
We use this technique to minimise the number of CNOT gates required to simulate chemical groundstates.
We observe significant reductions, up to $74%$, in CNOT counts on full connectivity.
- Score: 0.8655526882770742
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computers hold great promise for efficiently simulating Fermionic
systems, benefiting fields like quantum chemistry and materials science. To
achieve this, algorithms typically begin by choosing a Fermion-to-qubit mapping
to encode the Fermioinc problem in the qubits of a quantum computer. In this
work, we introduce "treespilation," a technique for efficiently mapping
Fermionic systems using a large family of favourable tree-based mappings
previously introduced by some of the authors. We use this technique to minimise
the number of CNOT gates required to simulate chemical groundstates found
numerically using the ADAPT-VQE algorithm. We observe significant reductions,
up to $74\%$, in CNOT counts on full connectivity and for limited qubit
connectivity-type devices such as IBM Eagle and Google Sycamore, we observe
similar reductions in CNOT counts. In many instances, the reductions achieved
on these limited connectivity devices even surpass the initial full
connectivity CNOT count. Additionally, we find our method improves the CNOT and
parameter efficiency of QEB- and qubit-ADAPT-VQE, which are, to our knowledge,
the most CNOT-efficient VQE protocols for molecular state preparation.
Related papers
- Beyond MP2 initialization for unitary coupled cluster quantum circuits [0.0]
unitary coupled cluster (UCC) ansatz is a promising tool for achieving high-precision results.
We advance the state of the art of UCC simulations by utilizing an efficient sparse wavefunction circuit solver.
arXiv Detail & Related papers (2023-01-13T17:06:50Z) - The Bonsai algorithm: grow your own fermion-to-qubit mapping [0.7049738935364298]
We present a formalism to design flexible fermion-to-qubit mappings from ternary trees.
We introduce a recipe that guarantees Fock basis states are mapped to computational basis states in qubit space.
We illustrate the algorithm by producing mappings for the heavy-hexagon topology widely used in IBM quantum computers.
arXiv Detail & Related papers (2022-12-19T18:53:08Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Symmetric Pruning in Quantum Neural Networks [111.438286016951]
Quantum neural networks (QNNs) exert the power of modern quantum machines.
QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes.
We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
arXiv Detail & Related papers (2022-08-30T08:17:55Z) - 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) - Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time.
As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware.
We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
arXiv Detail & Related papers (2022-02-17T18:59:20Z) - Qubit-efficient encoding scheme for quantum simulations of electronic
structure [5.16230883032882]
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits.
We propose a qubit-efficient encoding scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries.
Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era.
arXiv Detail & Related papers (2021-10-08T13:20:18Z) - On exploring practical potentials of quantum auto-encoder with
advantages [92.19792304214303]
Quantum auto-encoder (QAE) is a powerful tool to relieve the curse of dimensionality encountered in quantum physics.
We prove that QAE can be used to efficiently calculate the eigenvalues and prepare the corresponding eigenvectors of a high-dimensional quantum state.
We devise three effective QAE-based learning protocols to solve the low-rank state fidelity estimation, the quantum Gibbs state preparation, and the quantum metrology tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation.
Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
arXiv Detail & Related papers (2020-07-14T09:07:29Z)
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.