Finding Quantum Codes via Riemannian Optimization
- URL: http://arxiv.org/abs/2407.08423v1
- Date: Thu, 11 Jul 2024 12:03:41 GMT
- Title: Finding Quantum Codes via Riemannian Optimization
- Authors: Miguel Casanova, Kentaro Ohki, Francesco Ticozzi,
- Abstract summary: We propose a novel optimization to find optimally correctable subspace codes for a known quantum noise channel.
To each candidate subspace code we first associate a universal recovery map, as if the code was perfectly correctable.
When perfectly correctable codes cannot be found, a second optimization routine is run on the recovery Kraus map, also parametrized in a suitable Stiefel manifold.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We propose a novel optimization scheme designed to find optimally correctable subspace codes for a known quantum noise channel. To each candidate subspace code we first associate a universal recovery map, as if the code was perfectly correctable, and aim to maximize a performance functional that combines a modified channel fidelity with a tuneable regularization term that promotes simpler codes. With this choice optimization is performed only over the set of codes, and not over the set of recovery operators. The set of codes of fixed dimensions is parametrized as the complex-valued Stiefel manifold of the same dimension: the resulting non-convex optimization problem is then solved by gradient-based local algorithms. When perfectly correctable codes cannot be found, a second optimization routine is run on the recovery Kraus map, also parametrized in a suitable Stiefel manifold via Stinespring representation. To test the approach, correctable codes are sought in different scenarios and compared to existing ones: three qubits subjected to bit-flip errors (single and correlated), four qubits undergoing local amplitude damping and five qubits subjected to local depolarizing channels. Approximate codes are found and tested for the previous examples as well pure non-Markovian dephasing noise acting on a $7/2$ spin, induced by a $1/2$ spin bath, and the noise of the first three qubits of IBM's \texttt{ibm\_kyoto} quantum computer. The fidelity results are competitive with existing iterative optimization algorithms, with respect to which we maintain a strong computational advantage, while obtaining simpler codes.
Related papers
- Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping [3.47862118034022]
We present emphNoise-Directed Adaptive Remapping (NDAR), a meta-algorithm for approximately solving binary optimization problems by leveraging certain types of noise.
We demonstrate the effectiveness of our protocol in experiments with subsystems of the newest generation of Rigetti Computing's superconducting device Ankaa-2.
arXiv Detail & Related papers (2024-04-01T18:28:57Z) - The Near-optimal Performance of Quantum Error Correction Codes [2.670972517608388]
We derive the near-optimal channel fidelity, a concise and optimization-free metric for arbitrary codes and noise.
Compared to conventional optimization-based approaches, the reduced computational cost enables us to simulate systems with previously inaccessible sizes.
We analytically derive the near-optimal performance for the thermodynamic code and the Gottesman-Kitaev-Preskill (GKP) code.
arXiv Detail & Related papers (2024-01-04T01:44:53Z) - Quantum Approximation Optimization Algorithm for the trellis based
Viterbi decoding of classical error correcting codes [0.20305676256390928]
We construct a quantum-classical Viterbi decoder for the classical error-correcting codes.
We show that any number of paths with the minimum Hamming distance with respect to the received erroneous vector present in the trellis can be found.
arXiv Detail & Related papers (2023-04-05T08:25:14Z) - Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications.
This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
arXiv Detail & Related papers (2023-01-30T15:46:39Z) - Realizing a class of stabilizer quantum error correction codes using a
single ancilla and circular connectivity [0.0]
We show that a class of "neighboring-blocks" stabilizer quantum error correction codes can be implemented in a resource-efficient manner using a single ancilla and circular near-neighbor qubit connectivity.
We propose an implementation for syndrome-measurement circuits for codes from the class and illustrate its workings for cases of three-, five-, and nine-qubits stabilizer code schemes.
arXiv Detail & Related papers (2022-07-27T08:25:38Z) - Quantum Goemans-Williamson Algorithm with the Hadamard Test and
Approximate Amplitude Constraints [62.72309460291971]
We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits.
Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit.
We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
arXiv Detail & Related papers (2022-06-30T03:15:23Z) - Gradient-Free optimization algorithm for single-qubit quantum classifier [0.3314882635954752]
A gradient-free optimization algorithm is proposed to overcome the effects of barren plateau caused by quantum devices.
The proposed algorithm is demonstrated for a classification task and is compared with that using Adam.
The proposed gradient-free optimization algorithm can reach a high accuracy faster than that using Adam.
arXiv Detail & Related papers (2022-05-10T08:45:03Z) - Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity.
We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
arXiv Detail & Related papers (2022-03-01T19:47:16Z) - Sparse Quadratic Optimisation over the Stiefel Manifold with Application
to Permutation Synchronisation [71.27989298860481]
We address the non- optimisation problem of finding a matrix on the Stiefel manifold that maximises a quadratic objective function.
We propose a simple yet effective sparsity-promoting algorithm for finding the dominant eigenspace matrix.
arXiv Detail & Related papers (2021-09-30T19:17:35Z) - Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices.
We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT)
Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
arXiv Detail & Related papers (2020-10-01T18:14:11Z) - Convergence of adaptive algorithms for weakly convex constrained
optimization [59.36386973876765]
We prove the $mathcaltilde O(t-1/4)$ rate of convergence for the norm of the gradient of Moreau envelope.
Our analysis works with mini-batch size of $1$, constant first and second order moment parameters, and possibly smooth optimization domains.
arXiv Detail & Related papers (2020-06-11T17:43:19Z)
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.