Quantum state cloning is the task of approximately producing additional copies of an unknown quantum state from a finite number of input copies. The optimal cloning fidelity is known exactly for pure states, but no comparable characterization is known for general mixed states. We determine the optimal asymptotic copy complexity for $d$ -dimensional states of rank at most $r$ : producing $M$ additional copies with worst-case fidelity at least $1-\varepsilon$ requires and is achievable with $N=Θ(Mrd/\varepsilon)$ input copies. Remarkably, the lower bound already holds for a family of states with a fixed flat spectrum, while the matching upper bound is achieved by random purification followed by optimal pure-state cloning. For $M=1$ , we further show that high-fidelity tomography can be coherently converted into cloning with comparable error, revealing an operational origin of the matching cloning and tomography complexities.Quantum state cloning is the task of approximately producing additional copies of an unknown quantum state from a finite number of input copies. The optimal cloning fidelity is known exactly for pure states, but no comparable characterization is known for general mixed states. We determine the optimal asymptotic copy complexity for $d$-dimensional states of rank at most $r$: producing $M$ additional copies with worst-case fidelity at least $1-\varepsilon$ requires and is achievable with $N=Θ(Mrd/\varepsilon)$ input copies. Remarkably, the lower bound already holds for a family of states with a fixed flat spectrum, while the matching upper bound is achieved by random purification followed by optimal pure-state cloning. For $M=1$, we further show that high-fidelity tomography can be coherently converted into cloning with comparable error, revealing an operational origin of the matching cloning and tomography complexities.

quant-pharXiv:2608.24484Aug 26, 20260 citations

Comparing quantum complexity and quantum fidelity

Nadir Samos Sáenz de Buruaga

Quantum complexity measures the difficulty of obtaining a given state starting from a typically unentangled state. In this work, we show that complexity, when defined through the minimization of a Riemannian cost functional over the manifold of Gaussian states, provides the same information as quantum fidelity and is therefore capable of detecting quantum phase transitions. However, it does not offer a more refined analysis than entanglement entropy for a given state. We conclude that incorporating a notion of spatial locality into the computation of complexity is essential to uncover new physics beyond what is accessible through entanglement entropy and fidelity.Quantum complexity measures the difficulty of obtaining a given state starting from a typically unentangled state. In this work, we show that complexity, when defined through the minimization of a Riemannian cost functional over the manifold of Gaussian states, provides the same information as quantum fidelity and is therefore capable of detecting quantum phase transitions. However, it does not offer a more refined analysis than entanglement entropy for a given state. We conclude that incorporating a notion of spatial locality into the computation of complexity is essential to uncover new physics beyond what is accessible through entanglement entropy and fidelity.

arXiv:2503.09364Physical review. B./Physical review. BJun 3, 20250 citations

The Second Law of Quantum Complexity

Leonard Susskind

SpringerBriefs in physicsJan 1, 202045 citations

Constraint-native quantum control for fidelity--complexity trade-offs with inexact proximal ADMM

Ziwen Song

Quantum-control pulses are often optimised for nominal fidelity before waveform constraints are imposed. This sequence can conceal the fidelity cost of producing smooth, band-limited, and amplitude-admissible controls. Here, we evaluate a constraint-native alternative based on inexact proximal alternating-direction updates. The formulation combines gate-infidelity minimisation with amplitude bounds, Fourier-domain bandwidth projection, amplitude sparsity, and total-variation regularisation. We compare it with GRAPE, standard Krotov optimisation, and L-BFGS-B on a single-qubit gate, a leakage-prone qutrit gate, and a two-qubit entangler without a directly controlled target generator. Random seeds are paired across methods, and qutrit computational-subspace fidelity is reported alongside leakage. PADMM-Warm reached mean qutrit and two-qubit fidelities of $0.6363$ and $0.9541$ , respectively, while reducing total variation by factors of $13.2$ and $10.7$ relative to L-BFGS-B. These results define a reproducible fidelity--complexity trade-off, not a universal fidelity advantage. The method is therefore a numerical tool for exploring low-complexity control frontiers rather than a replacement for unconstrained high-fidelity solvers.Quantum-control pulses are often optimised for nominal fidelity before waveform constraints are imposed. This sequence can conceal the fidelity cost of producing smooth, band-limited, and amplitude-admissible controls. Here, we evaluate a constraint-native alternative based on inexact proximal alternating-direction updates. The formulation combines gate-infidelity minimisation with amplitude bounds, Fourier-domain bandwidth projection, amplitude sparsity, and total-variation regularisation. We compare it with GRAPE, standard Krotov optimisation, and L-BFGS-B on a single-qubit gate, a leakage-prone qutrit gate, and a two-qubit entangler without a directly controlled target generator. Random seeds are paired across methods, and qutrit computational-subspace fidelity is reported alongside leakage. PADMM-Warm reached mean qutrit and two-qubit fidelities of $0.6363$ and $0.9541$, respectively, while reducing total variation by factors of $13.2$ and $10.7$ relative to L-BFGS-B. These results define a reproducible fidelity--complexity trade-off, not a universal fidelity advantage. The method is therefore a numerical tool for exploring low-complexity control frontiers rather than a replacement for unconstrained high-fidelity solvers.

quant-pharXiv:2603.13020Mar 16, 20260 citations

Complete characterization of the single-qubit quantum gates used in the IBM quantum processors

Abhishek Shukla, Mitali Sisodia, Anirban Pathak

Quantum process tomography of each single-qubit quantum gate used in the IBM quantum processors is performed to compute gate error in order to check viability of complex quantum operations in the superconductivity-based quantum computers introduced by IBM and to compare the quality of these gates with the corresponding gates implemented using other technologies. Gate fidelities for all the allowed gates for every allowed position (i.e., by placing the gates in different qubit lines) have been obtained and reported for IBM QX4 architecture. Gate fidelities are observed to be lower than the corresponding values obtained in the other technologies, like NMR. Further, gate fidelities for all the single-qubit gates are obtained for IBM QX2 architecture by placing the gates in the third qubit line ( $q[2]$ ). It's observed that the IBM QX4 architecture yields better gate fidelity compared to IBM QX2 in all cases except the case of $\operatorname{Y}$ gate as far as the gate fidelity corresponding to the third qubit line is concerned. In general, the analysis performed here leads to a conclusion that a considerable technological improvement would be inevitable to achieve the desired scalability required for the realization of complex quantum operations.Quantum process tomography of each single-qubit quantum gate used in the IBM quantum processors is performed to compute gate error in order to check viability of complex quantum operations in the superconductivity-based quantum computers introduced by IBM and to compare the quality of these gates with the corresponding gates implemented using other technologies. Gate fidelities for all the allowed gates for every allowed position (i.e., by placing the gates in different qubit lines) have been obtained and reported for IBM QX4 architecture. Gate fidelities are observed to be lower than the corresponding values obtained in the other technologies, like NMR. Further, gate fidelities for all the single-qubit gates are obtained for IBM QX2 architecture by placing the gates in the third qubit line ($q[2]$). It's observed that the IBM QX4 architecture yields better gate fidelity compared to IBM QX2 in all cases except the case of $\operatorname{Y}$ gate as far as the gate fidelity corresponding to the third qubit line is concerned. In general, the analysis performed here leads to a conclusion that a considerable technological improvement would be inevitable to achieve the desired scalability required for the realization of complex quantum operations.

May 18, 20184 citations

d

-dimensional states of rank at most

r

: producing

M

additional copies with worst-case fidelity at least

1-\varepsilon

requires and is achievable with

N=Θ(Mrd/\varepsilon)

input copies. Remarkably, the lower bound already holds for a family of states with a fixed flat spectrum, while the matching upper bound is achieved by random purification followed by optimal pure-state cloning. For

M=1

, we further show that high-fidelity tomography can be coherently converted into cloning with comparable error, revealing an operational origin of the matching cloning and tomography complexities.

0.6363

and

0.9541

, respectively, while reducing total variation by factors of

13.2

and

10.7

relative to L-BFGS-B. These results define a reproducible fidelity--complexity trade-off, not a universal fidelity advantage. The method is therefore a numerical tool for exploring low-complexity control frontiers rather than a replacement for unconstrained high-fidelity solvers.

q[2]

). It's observed that the IBM QX4 architecture yields better gate fidelity compared to IBM QX2 in all cases except the case of

\operatorname{Y}

gate as far as the gate fidelity corresponding to the third qubit line is concerned. In general, the analysis performed here leads to a conclusion that a considerable technological improvement would be inevitable to achieve the desired scalability required for the realization of complex quantum operations.