Next Article in Journal
Kernel Partial Least Squares Feature Selection Based on Maximum Weight Minimum Redundancy
Previous Article in Journal
Toward Prediction of Financial Crashes with a D-Wave Quantum Annealer
Previous Article in Special Issue
A Novel Approach to Parameter Determination of the Continuous Spontaneous Localization Collapse Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Correcting Coherent Errors by Random Operation on Actual Quantum Hardware

by
Gabriele Cenedese
1,2,
Giuliano Benenti
1,2,3 and
Maria Bondani
4,*
1
Center for Nonlinear and Complex Systems, Dipartimento di Scienza e Alta Tecnologia, Università degli Studi dell’Insubria, Via Valleggio 11, 22100 Como, Italy
2
Istituto Nazionale di Fisica Nucleare, Sezione di Milano, Via Celoria 16, 20133 Milano, Italy
3
NEST, Istituto Nanoscienze-CNR, 56126 Pisa, Italy
4
Istituto di Fotonica e Nanotecnologie, Consiglio Nazionale delle Ricerche, Via Valleggio 11, 22100 Como, Italy
*
Author to whom correspondence should be addressed.
Entropy 2023, 25(2), 324; https://doi.org/10.3390/e25020324
Submission received: 29 November 2022 / Revised: 20 December 2022 / Accepted: 8 February 2023 / Published: 10 February 2023

Abstract

:
Characterizing and mitigating errors in current noisy intermediate-scale devices is important to improve the performance of the next generation of quantum hardware. To investigate the importance of the different noise mechanisms affecting quantum computation, we performed a full quantum process tomography of single qubits in a real quantum processor in which echo experiments are implemented. In addition to the sources of error already included in the standard models, the obtained results show the dominant role of coherent errors, which we practically corrected by inserting random single-qubit unitaries in the quantum circuit, significantly increasing the circuit length over which quantum computations on actual quantum hardware produce reliable results.

1. Introduction

Quantum computers operating with ∼50–100 qubits may be able to perform tasks surpassing the abilities of the present classical digital super-computers [1,2], and have recently been suggested to possess a quantum advantage in specific problems [3,4,5]. However, this quantum advantage can only be reached with a high enough quantum gate precision and through-processes that generate enough entanglement to outperform the classical tensor network methods [6]. Unfortunately, noisy intermediate-scale quantum (NISQ) devices at present suffer from significant decoherence and the effects of various sources of noise, such as residual inter-qubit coupling or interactions with an uncontrolled environment. Noise limits the size of the quantum circuits that can be reliably executed; therefore, achieving a quantum advantage in complex, practically relevant problems is still an imposing challenge.
It is, therefore, important to benchmark the progress in the currently available quantum computers [7,8], and possibly find suitable error-mitigation strategies. Here, we focus on freely available IBM quantum processors. IBM provides a few characteristic noise parameters for these processors: qubit relaxation time, qubit dephasing time, and error rates in single-qubit gates, two-qubit CNOT gates and quantum measurements. Such parameters are updated after each hardware calibration and provide very useful information for the assessment of quantum hardware performance. Nevertheless, as we will show below, these noise channels are not sufficient for an accurate description of the errors affecting a quantum computer. As a general observation, we note that, even in the simplest case of memoryless errors, the general description of quantum noise in terms of quantum operations requires many real parameters N p = N 4 N 2 , where N = 2 n is the Hilbert space dimension for n qubits [1]. For a single qubit N p = 12 , these parameters have a simple intuitive interpretation in terms of rotations, deformations, and displacements of the Bloch sphere. Furthermore, coherent errors [9,10,11,12,13,14,15,16,17,18], that is, unitary errors that slowly vary relative to the gate time, can arise for several reasons, including miscalibration or drifts away from the control system calibration used to drive the qubit operations, cross-talk with neighboring qubits, external fields, and residual qubit–qubit interactions. Such errors cannot be removed with standard error-correcting codes [1] developed for stochastic (incoherent), uncorrelated, memoryless errors.
Here, we describe the evolution of a qubit inside an operating quantum computer as a quantum operation or a completely positive trace-preserving (CPT) map acting on the single-qubit Bloch sphere. Our first goal is to provide a full characterization of such a CPT map, that is, a quantum process tomography going beyond the few noise channels noted above, in order to analyze the performances of the current noisy quantum hardware and define a useful benchmark for new releases of quantum computers. We consider a quantum echo experiment as the quantum noise travel, reversing a quantum computation, so that in the ideal noiseless case we could reconstruct the initial state. More specifically, we consider an even sequence of CNOT gates ( CNOT 2 = I ) and a more general sequence of two-qubit random unitary operators, combined with their time-reversal operators, to perform the echo experiment. The comparison between the results from the quantum noise tomography on the IBM quantum hardware and those obtained with the Qiskit simulator, which only considers a limited number of noise channels, highlights the relevance of coherent errors. This observation suggests that random single-qubit gates could be introduced to the logical circuit to suppress coherent errors [19,20]. We demonstrate the effectiveness of such a strategy in the above CNOT–echo experiment. Alternatively, in the case of a realistic quantum computation without echoes, one could insert random Pauli gates between circuit elements, such as CNOTs (randomized compiling), as shown in [20,21,22].
The paper is organized as follows. In Section 2 we recall the Bloch sphere representation of a CPT map for a single qubit and the main steps in the consequent quantum process tomography. In Section 3, the echo results obtained from IBM quantum processors are shown and compared with those of the IBM simulator. In Section 4 we discuss the effectiveness of the randomization strategy for coherent error correction. Our conclusions are drawn in Section 5.

2. CPT Maps on the Bloch Sphere

As it is well-known, a two-level system (a qubit) state can be represented by a point in a ball of unit radius, called the Bloch ball, embedded in R 3 , which defines the so-called Bloch vector ( r ). Pure states are those that lie on the surface of the ball ( | r | = 1 ), i.e., the Bloch sphere, while mixed states are those inside the sphere ( | r | < 1 ). An ideal quantum echo experiment should leave pure states on the sphere, while, in the real case, the length of the Bloch vector generally decreases.
Given an initial single-qubit state ρ , we considered the quantum noise channel, or a completely positive trace-preserving (CPT) map S , as a quantum black box, representing the qubit interacting with a generic physical system. Without any a-priori knowledge of the quantum noise processes affecting the qubit, we could reconstruct S by preparing different input states ρ , with each of them measuring the output state ρ = S ( ρ ) . In the Bloch-sphere representation, the Bloch vector evolves as an affine map:
r r = M r + c .
To perform a full quantum process tomography, i.e., to reconstruct the matrix M and the vector c , we needed to perform 12 different experiments. In each experiment, we prepared one of the four initial states
| 0 , | 1 , | x = 1 2 ( | 0 + | 1 ) , | y = 1 2 ( | 0 + i | 1 ) .
For each initial state, we measured the polarization of the final state ρ down the channel, along one of the three coordinate axes, to estimate the final Bloch vector for each input state. Each experiment was repeated many times, N r = 25 , with N m = 8192 runs each time, to reconstruct M and c with high accuracy. In the case of a sequence of random unitaries, N r = 25 sequences of two-qubit random unitaries were extracted from the Haar measure on the unitary group U ( 4 ) [23,24,25].
The quality of the quantum channel was measured by the fidelity F between the ideally pure single-qubit initial state | ψ i n and the final, generally mixed, state ρ o u t :
F = ψ i n | ρ o u t | ψ i n .
We evaluated the fidelity using both the Qiskit simulator and the real quantum hardware for the initial states of Equation (2) and the echo protocols described below.

3. Single-Qubit Quantum Process Tomography

All experiments on actual quantum hardware were performed on i b m _ l a g o s . We reconstructed the evolution of the Bloch sphere of qubit 0 ( q 0 ) with qubit 1 ( q 1 ) as the ancilla. The CNOT gates of the CNOT noisy channel were performed with q 0 as the control qubit. Note that using q 0 as the target qubit did not qualitatively alter the results.

3.1. CNOT Noisy Channel

The fidelities obtained with the sequence of noisy CNOTs (the CNOT noisy channel) are shown in Figure 1. The results of the Qiskit simulations are easily interpreted, as follows. Since one problem in the CNOT is the long gate time, the dephasing and the energy relaxation errors (parametrized by the decoherence times T 1 and T 2 ) become important. The state |0〉, which is not affected by these kinds of error, presents better fidelities than |1〉, |x〉 and |y〉; with |1〉 being slightly better than |x〉 and |y〉, since it is only affected by the relaxation. The results obtained with the actual device did not reflect the Qiskit simulation, and the reason for this can be understood by looking at the evolution of the Bloch sphere depicted in Figure 2. In the Qiskit simulations, the sphere deforms, becoming an ellipsoid with a semi-major axis at the z-axis, and the center shifts in the direction of positive z’s. This mirrors what occurs with fidelities, with states near the north pole (which represent the state |0〉) of the spheres being gradually less affected by dephasing and energy relaxation. Ellipsoids are still formed in the real quantum hardware case, but they appear to be rotated, with the semi-major axis no longer in the z-direction. This can be interpreted (see below) as the result of some kind of coherent error, which induces undesired rotations of the Bloch sphere.

3.2. Random Unitaries

We now consider sequences of two-qubit random unitaries U k , with k running from 1 to the number of steps N s , combined with their inverse U k , to realize the echo experiment. In summary, we implemented the overall random quantum circuit k = 1 N s U k U k . In contrast with the CNOT channel, as shown in Figure 3, the Qiskit simulation’s fidelities of the four basis states are comparable. This can be easily understood: the CNOTs in the decomposition into elementary quantum logic gates of general two-qubit unitary operators are always preceded by a single-qubit random rotation (see Appendix A). As a consequence, whatever the initial state, CNOTs act on a random state of the sphere, and the error due to dephasing and relaxation is, on average, independent of the initial state. For the same reason, we anticipate that the effects of coherent errors cancel each other out. Indeed, we expect from the previous literature [19] that the deleterious effect of such errors is greatly reduced if they are randomized by repeatedly rotating the computational basis via random single-qubit unitaries. The fact that, unlike the CNOT channel, the actual hardware has a comparable performance to that predicted by the Qiskit simulator (see Figure 4), demonstrates that, for the CNOT channel, hardware peformance degradation should largely be ascribed to coherent errors.

4. Error Correction by Randomization

In the case of the CNOT noisy channel, the nature of the coherent noise suggests a natural error correction procedure that occurs repeatedly rotating the computational basis. The idea is that, before any CNOT pair, a random single qubit unitary gate is applied at each qubit of the noise channel and the respective adjoint after the CNOTs to globally obtain the identity. Alternatively, we took randomly chosen rotations with respect to x or y (also randomly selected) to decrease the number of logic gates used for the correction (see Appendix B). As we can see in Figure 5, the fidelities significantly improve when compared with those of the CNOT noisy channel without correction; moreover, they are independent of the initial state. The results with single-axis rotations are comparable with those of generic single-qubit unitary operators.
However, in a generic quantum computation, the circuit is not reversed as it is for a CNOT pair, for which ( CNOT ) 2 = I . Nevertheless, coherent errors can still be mitigated. For instance, a single CNOT gate can be treated by compensating the pre-CNOT random rotations with suitable rotations after the CNOT so that the CNOT gate is effectively operated overall. To achieve this purpose, we exploited the commutation rules between CNOT and single-qubit rotations. Note that, instead of a generic rotation, it is easier and sufficient to consider randomly chosen Pauli gates { I , X , Y , Z } [20,21,22], for which we have the following identities: ( X X ) CNOT ( X I ) = CNOT , ( Y Y ) CNOT ( X ( Z ) ) = CNOT , ( X Y ) CNOT ( X ( Y ) ) = CNOT , and so on.

5. Conclusions

We have noted the presence of coherent errors in echo experiments performed on actual quantum hardware. We have considered two quantum noise channels: one formed by a sequence of CNOT gates, the other by random two-qubit interactions. The former clearly shows the presence of coherent errors by observing the rotation of Bloch spheres. The latter suggests that randomization of the computation basis leads to the natural cancellation of coherent errors, as we practically demonstrate for a sequence of CNOT gates. Removing this kind of noise is the first step in implementing a successful error correction procedure.

Author Contributions

G.C. performed quantum simulations by coding actual IBM quantum processors. G.B. and M.B. supervised the work. All authors discussed the results and contributed to writing and revising the manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

G.C. and G.B. acknowlewdges the financial support of the INFN through the project QUANTUM.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The datasets used and analyzed in the current study are available from the corresponding author on reasonable request.

Acknowledgments

We acknowledge use of the IBM Quantum Experience for this work. The views expressed are those of the authors and do not reflect the official policy or position of IBM company or the IBM-Q team.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

Appendix A. Cartan’s KAK Decomposition of the Unitary Group

Cartan’s KAK decomposition can be used to construct an optimal quantum circuit and achieve a general two-qubit quantum gate, up to a global phase, which requires, at most, 3 CNOT and 15 elementary one-qubit gates from the family { R y , R z } , i.e., single-qubit rotations obtained by exponentiating the corresponding Pauli matrices. It can be proven that this construction is optimal, in the sense that there is no smaller circuit, using the same family of gates, that achieves this operation [26].
Following the general prescription [27,28], one can decompose every S U ( 4 ) element, as depicted in Figure A1, where A j S U ( 2 ) are single-qubit unitaries that are decomposable into elementary one-qubit gates according to the well-known Euler strategy. Note that, in order to randomly extract one of these operators, the angles of the single-qubit rotations must be uniformly extracted with respect to the Haar measure of the unitary group.
Figure A1. A quantum circuit implementing a two-qubit unitary gate using the KAK parametrization of S U ( 4 ) .
Figure A1. A quantum circuit implementing a two-qubit unitary gate using the KAK parametrization of S U ( 4 ) .
Entropy 25 00324 g0a1

Appendix B. CNOT Noisy Channel Ccoherent Errors Correction

The quantum circuit of the CNOT noisy channel with coherent error correction is shown in Figure A2. The R gates before and after the CNOT gates are U ( 2 ) operators, which are randomly chosen with respect to the Haar measure of the unitary group, or randomly chosen { R x , R y } gates, as mentioned above.
Figure A2. A circuit implementing the coherent error correction for the CNOT noisy channel. Two echo steps are shown.
Figure A2. A circuit implementing the coherent error correction for the CNOT noisy channel. Two echo steps are shown.
Entropy 25 00324 g0a2

References

  1. Benenti, G.; Casati, G.; Rossini, D.; Strini, G. Principles of Quantum Computation and Information (A Comprehensive Textbook); World Scientific: Singapore, 2019. [Google Scholar]
  2. Preskill, J. Quantum Computing in the NISQ era and beyond. Quantum 2018, 2, 79. [Google Scholar] [CrossRef]
  3. Arute, F.; Arya, K.; Babbush, R.; Bacon, D.; Bardin, J.C.; Barends, R.; Biswas, R.; Boixo, S.; Brandao, F.G.S.L.; Buell, D.A.; et al. Quantum supremacy using a programmable superconducting processor. Nature 2019, 574, 505–510. [Google Scholar] [CrossRef]
  4. Zhong, H.S.; Wang, H.; Deng, Y.H.; Chen, M.C.; Peng, L.C.; Luo, Y.H.; Qin, J.; Wu, D.; Ding, X.; Hu, Y.; et al. Quantum computational advantage using photons. Science 2020, 370, 1460–1463. [Google Scholar] [CrossRef]
  5. Daley, A.J.; Bloch, I.; Kokail, C.; Flannigan, S.; Pearson, N.; Troyer, M.; Zoller, P. Practical quantum advantage in quantum simulation. Nature 2022, 607, 667–676. [Google Scholar] [CrossRef]
  6. Zhou, Y.; Stoudenmire, E.M.; Waintal, X. What Limits the Simulation of Quantum Computers? Phys. Rev. X 2020, 10, 041038. [Google Scholar] [CrossRef]
  7. Cross, A.W.; Bishop, L.S.; Sheldon, S.; Nation, P.D.; Gambetta, J.M. Validating quantum computers using randomized model circuits. Phys. Rev. A 2019, 100, 032328. [Google Scholar] [CrossRef]
  8. Pizzamiglio, A.; Chang, S.Y.; Bondani, M.; Montangero, S.; Gerace, D.; Benenti, G. Dynamical Localization Simulated on Actual Quantum Hardware. Entropy 2021, 23, 654. [Google Scholar] [CrossRef]
  9. Georgeot, B.; Shepelyansky, D.L. Quantum chaos border for quantum computing. Phys. Rev. E 2000, 62, 3504–3507. [Google Scholar] [CrossRef]
  10. Georgeot, B.; Shepelyansky, D.L. Emergence of quantum chaos in the quantum computer core and how to manage it. Phys. Rev. E 2000, 62, 6366–6375. [Google Scholar] [CrossRef]
  11. Benenti, G.; Casati, G.; Shepelyansky, D.L. Emergence of Fermi-Dirac thermalization in the quantum computer core. Eur. Phys. J. D 2001, 17, 265–272. [Google Scholar] [CrossRef] [Green Version]
  12. Benenti, G.; Casati, G.; Montangero, S.; Shepelyansky, D.L. Efficient Quantum Computing of Complex Dynamics. Phys. Rev. Lett. 2001, 87, 227901. [Google Scholar] [CrossRef]
  13. Benenti, G.; Casati, G.; Montangero, S.; Shepelyansky, D.L. Dynamical localization simulated on a few-qubit quantum computer. Phys. Rev. A 2003, 67, 052312. [Google Scholar] [CrossRef]
  14. Montangero, S.; Benenti, G.; Fazio, R. Dynamics of Entanglement in Quantum Computers with Imperfections. Phys. Rev. Lett. 2003, 91, 187901. [Google Scholar] [CrossRef]
  15. Henry, M.K.; Emerson, J.; Martinez, R.; Cory, D.G. Localization in the quantum sawtooth map emulated on a quantum-information processor. Phys. Rev. A 2006, 74, 062317. [Google Scholar] [CrossRef]
  16. Benenti, G.; Casati, G. Quantum chaos, decoherence and quantum computation. La Riv. Del Nuovo Cim. 2007, 30, 449–484. [Google Scholar] [CrossRef]
  17. Greenbaum, D.; Dutton, Z. Modeling coherent errors in quantum error correction. Quantum Sci. Technol. 2017, 3, 015007. [Google Scholar] [CrossRef]
  18. Majumder, S.; Yale, C.G.; Morris, T.D.; Lobser, D.S.; Burch, A.D.; Chow, M.N.H.; Revelle, M.C.; Clark, S.M.; Pooser, R.C. Characterizing and mitigating coherent errors in a trapped ion quantum processor using hidden inverses. arXiv 2022, arXiv:2205.14225. [Google Scholar] [CrossRef]
  19. Kern, O.; Alber, G.; Shepelyansky, D.L. Quantum error correction of coherent errors by randomization. Eur. Phys. J. D At. Mol. Opt. Plasma Phys. 2005, 32, 153–156. [Google Scholar] [CrossRef]
  20. Wallman, J.J.; Emerson, J. Noise tailoring for scalable quantum computation via randomized compiling. Phys. Rev. A 2016, 94, 052325. [Google Scholar] [CrossRef]
  21. Hashim, A.; Naik, R.K.; Morvan, A.; Ville, J.L.; Mitchell, B.; Kreikebaum, J.M.; Davis, M.; Smith, E.; Iancu, C.; O’Brien, K.P.; et al. Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quantum Processor. Phys. Rev. X 2021, 11, 041039. [Google Scholar] [CrossRef]
  22. Ware, M.; Ribeill, G.; Ristè, D.; Ryan, C.A.; Johnson, B.; da Silva, M.P. Experimental Pauli-frame randomization on a superconducting qubit. Phys. Rev. A 2021, 103, 042604. [Google Scholar] [CrossRef]
  23. Pozniak, M.; Zyczkowski, K.; Kus, M. Composed ensembles of random unitary matrices. J. Phys. A Math. Gen. 1998, 31, 1059. [Google Scholar] [CrossRef]
  24. Weinstein, Y.S.; Hellberg, C.S. Entanglement Generation of Nearly Random Operators. Phys. Rev. Lett. 2005, 95, 030501. [Google Scholar] [CrossRef] [PubMed]
  25. Shaghaghi, V.; Palma, G.M.; Benenti, G. Extracting work from random collisions: A model of a quantum heat engine. Phys. Rev. E 2022, 105, 034101. [Google Scholar] [CrossRef]
  26. Vatan, F.; Williams, C. Optimal quantum circuits for general two-qubit gates. Phys. Rev. A 2004, 69, 032315. [Google Scholar] [CrossRef]
  27. Khaneja, N.; Glaser, S.J. Cartan decomposition of SU (2n) and control of spin systems. Chem. Phys. 2001, 267, 11–23. [Google Scholar] [CrossRef]
  28. Khaneja, N.; Brockett, R.; Glaser, S.J. Time optimal control in spin systems. Phys. Rev. A 2001, 63, 032308. [Google Scholar] [CrossRef] [Green Version]
Figure 1. Fidelities of the 4 states used to reconstruct the CPT map as a function of the number of steps (one step of the CNOT noisy channel corresponds to two CNOT gates). (Left) simulations with the noise parameters of ibm_lagos, calibration of 2 November 2022. (Right) actual results obtained with ibm_lagos on 2 November 2022.
Figure 1. Fidelities of the 4 states used to reconstruct the CPT map as a function of the number of steps (one step of the CNOT noisy channel corresponds to two CNOT gates). (Left) simulations with the noise parameters of ibm_lagos, calibration of 2 November 2022. (Right) actual results obtained with ibm_lagos on 2 November 2022.
Entropy 25 00324 g001
Figure 2. Evolution of the single qubit Bloch ball as a function of the number of CNOT map steps. From left to right, the number of steps increases in correspondence with the data shown in Figure 1. (a) Qiskit Simulations with the noise parameters of ibm_lagos. The segment highlighted in red shows the major axis of the ellipsoid; the gray sphere is the unit-radius Bloch ball. (b) Results obtained with ibm_lagos. The segment highlighted in green shows the major axis of the ellipsoid; the gray sphere is unit-radius Bloch ball. Data from the quantum processor, taken on 2 November 2022, with the corresponding calibration parameters used for Qiskit simulations.
Figure 2. Evolution of the single qubit Bloch ball as a function of the number of CNOT map steps. From left to right, the number of steps increases in correspondence with the data shown in Figure 1. (a) Qiskit Simulations with the noise parameters of ibm_lagos. The segment highlighted in red shows the major axis of the ellipsoid; the gray sphere is the unit-radius Bloch ball. (b) Results obtained with ibm_lagos. The segment highlighted in green shows the major axis of the ellipsoid; the gray sphere is unit-radius Bloch ball. Data from the quantum processor, taken on 2 November 2022, with the corresponding calibration parameters used for Qiskit simulations.
Entropy 25 00324 g002
Figure 3. As in Figure 1, but for random unitaries. Qiskit (left) and actual hardware (right) data were obtained with ibm_lagos on 2 November 2022.
Figure 3. As in Figure 1, but for random unitaries. Qiskit (left) and actual hardware (right) data were obtained with ibm_lagos on 2 November 2022.
Entropy 25 00324 g003
Figure 4. As in Figure 2, but for the random unitaries channel of Figure 3.
Figure 4. As in Figure 2, but for the random unitaries channel of Figure 3.
Entropy 25 00324 g004
Figure 5. Fidelities of the 4 basis states as a function of the number of steps (one step in the CNOT noisy channel corresponds to two CNOT gates) after the correction procedure described above. On the left, the computational basis is rotated with random unitaries; that on the right undergoes single-axis rotations. The purple curve represents the average fidelities obtained without correction. Results obtained with i b m _ l a g o s on 20 November 2022.
Figure 5. Fidelities of the 4 basis states as a function of the number of steps (one step in the CNOT noisy channel corresponds to two CNOT gates) after the correction procedure described above. On the left, the computational basis is rotated with random unitaries; that on the right undergoes single-axis rotations. The purple curve represents the average fidelities obtained without correction. Results obtained with i b m _ l a g o s on 20 November 2022.
Entropy 25 00324 g005
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Cenedese, G.; Benenti, G.; Bondani, M. Correcting Coherent Errors by Random Operation on Actual Quantum Hardware. Entropy 2023, 25, 324. https://doi.org/10.3390/e25020324

AMA Style

Cenedese G, Benenti G, Bondani M. Correcting Coherent Errors by Random Operation on Actual Quantum Hardware. Entropy. 2023; 25(2):324. https://doi.org/10.3390/e25020324

Chicago/Turabian Style

Cenedese, Gabriele, Giuliano Benenti, and Maria Bondani. 2023. "Correcting Coherent Errors by Random Operation on Actual Quantum Hardware" Entropy 25, no. 2: 324. https://doi.org/10.3390/e25020324

APA Style

Cenedese, G., Benenti, G., & Bondani, M. (2023). Correcting Coherent Errors by Random Operation on Actual Quantum Hardware. Entropy, 25(2), 324. https://doi.org/10.3390/e25020324

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop