Optimal Entropy Compression and Purification in Quantum Bits
- URL: http://arxiv.org/abs/2001.00562v4
- Date: Wed, 4 May 2022 03:12:28 GMT
- Title: Optimal Entropy Compression and Purification in Quantum Bits
- Authors: Varad R. Pande
- Abstract summary: circuits enable purity increment in computation qubit by maximally transferring part of its von Neumann or Shannon entropy to any number of surrounding qubits.
In addition to multi-qubit purification and satisfying two of DiVincenzo's criteria for quantum computation in some architectures, implications of this work for quantum data compression and quantum thermodynamics are discussed.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Global unitary transformations (OPTSWAPS) that optimally increase the bias of
any mixed computation qubit in a quantum system -- represented by a diagonal
density matrix -- towards a particular state of the computational basis which,
in effect, increases its purity are presented. Quantum circuits that achieve
this by implementing the above data compression technique -- a generalization
of the 3B-Comp used before -- are described. These circuits enable purity
increment in the computation qubit by maximally transferring part of its von
Neumann or Shannon entropy to any number of surrounding qubits and are valid
for the complete range of initial biases. Using the optswaps, a practicable new
method that algorithmically achieves hierarchy-dependent cooling of qubits to
their respective limits in an engineered quantum register opened to the
heat-bath is delineated. In addition to multi-qubit purification and satisfying
two of DiVincenzo's criteria for quantum computation in some architectures, the
implications of this work for quantum data compression and quantum
thermodynamics are discussed.
Related papers
- Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO)
Our purely quantum approach eliminates the dependency on classical variational quantum algorithms.
It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
arXiv Detail & Related papers (2024-05-22T18:11:42Z) - Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.
We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.
We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - 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) - Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit.
The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$.
We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
arXiv Detail & Related papers (2021-12-29T12:33:41Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy
Sorting [3.0998962250161783]
Quantum computation represents a revolutionary approach for solving problems in quantum chemistry.
Due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remains a major task.
In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes can be significantly reduced by an energy-sorting strategy.
arXiv Detail & Related papers (2021-06-29T09:51:19Z) - A posteriori corrections to the Iterative Qubit Coupled Cluster method
to minimize the use of quantum resources in large-scale calculations [0.0]
We present a variety of a posteriori corrections to the iQCC energies to reduce the number of iterations to achieve the desired accuracy.
We demonstrate the utility and efficiency of our approach numerically on the examples of 10-qubit N$$ molecule, the 24-qubit H$$O stretch, and 56-qubit singlet-triplet gap calculations.
arXiv Detail & Related papers (2020-09-28T20:57:32Z) - Measuring Analytic Gradients of General Quantum Evolution with the
Stochastic Parameter Shift Rule [0.0]
We study the problem of estimating the gradient of the function to be optimized directly from quantum measurements.
We derive a mathematically exact formula that provides an algorithm for estimating the gradient of any multi-qubit parametric quantum evolution.
Our algorithm continues to work, although with some approximations, even when all the available quantum gates are noisy.
arXiv Detail & Related papers (2020-05-20T18:24:11Z)
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.