arXiv subjects

Iman Marvian

Publications and source records attributed to Iman Marvian.

At least 37 records · Page 2Linked to original sources

arXiv2024

Synthesis of Energy-Conserving Quantum Circuits with XY interaction

We study quantum circuits constructed from $\sqrt{iSWAP}$ gates and, more generally, from the entangling gates that can be realized with the XX+YY interaction alone. Such gates preserve the Hamming weight of states in the computational basis, which means they respect the global U(1) symmetry corresponding to rotations around the z axis. Equivalently, assuming that the intrinsic Hamiltonian of each qubit in the system is the Pauli Z operator, they conserve the total energy of the system. We develop efficient methods for synthesizing circuits realizing any desired energy-conserving unitary using XX+YY interaction with or without single-qubit rotations around the z-axis. Interestingly, implementing generic energy-conserving unitaries, such as CCZ and Fredkin gates, with 2-local energy-conserving gates requires the use of ancilla qubits. When single-qubit rotations around the z-axis are permitted, our scheme requires only a single ancilla qubit, whereas with the XX+YY interaction alone, it requires 2 ancilla qubits. In addition to exact realizations, we also consider approximate realizations and show how a general energy-conserving unitary can be synthesized using only a sequence of $\sqrt{iSWAP}$ gates and 2 ancillary qubits, with arbitrarily small error, which can be bounded via the Solovay-Kitaev theorem. Our methods are also applicable for synthesizing energy-conserving unitaries when, rather than the XX+YY interaction, one has access to any other energy-conserving 2-body interaction that is not diagonal in the computational basis, such as the Heisenberg exchange interaction. We briefly discuss the applications of these circuits in the context of quantum computing, quantum thermodynamics, and quantum clocks.

quant-ph↗

arXiv2024

Observation of the Symmetry-Protected Signature of 3-body Interactions

Identifying and characterizing multi-body interactions in quantum processes remains a significant challenge. This is partly because 2-body interactions can produce an arbitrary time evolution, a fundamental fact often called the universality of 2-local gates in the context of quantum computing. However, when an unknown Hamiltonian respects a U(1) symmetry such as charge or particle number conservation, N-body interactions exhibit a distinct symmetry-protected signature known as the N-body phase, which fewer-body interactions cannot mimic. We develop and demonstrate an efficient technique for the detection of 3-body interactions despite the presence of unknown 2-body interactions. This technique, which takes advantage of GHZ states for phase estimation, requires probing the unitary evolution and measuring its determinant in a small subspace that scales linearly with the system size, making it an efficient approach.

quant-ph↗

arXiv2024

Restrictions on realizable unitary operations imposed by symmetry and locality

According to a fundamental result in quantum computing, any unitary transformation on a composite system can be generated using so-called 2-local unitaries that act only on two subsystems. Beyond its importance in quantum computing, this result can also be regarded as a statement about the dynamics of systems with local Hamiltonians: although locality puts various constraints on the short-term dynamics, it does not restrict the possible unitary evolutions that a composite system with a general local Hamiltonian can experience after a sufficiently long time. Here we show that this universality does not remain valid in the presence of conservation laws and global continuous symmetries such as U(1) and SU(2). In particular, we show that generic symmetric unitaries cannot be implemented, even approximately, using local symmetric unitaries. Based on this no-go theorem, we propose a method for experimentally probing the locality of interactions in nature. In the context of quantum thermodynamics, our results mean that generic energy-conserving unitary transformations on a composite system cannot be realized solely by combining local energy-conserving unitaries on the components. We show how this can be circumvented via catalysis.

quant-ph↗

arXiv2024

A framework for semi-universality: Semi-universality of 3-qudit SU(d)-invariant gates

Quantum circuits with symmetry-respecting gates have attracted broad interest in quantum information science. While recent work has developed a theory for circuits with Abelian symmetries, revealing important distinctions between Abelian and non-Abelian cases, a comprehensive framework for non-Abelian symmetries has been lacking. In this work, we develop novel techniques and a powerful framework that is particularly useful for understanding circuits with non-Abelian symmetries. Using this framework we settle an open question on quantum circuits with SU(d) symmetry. We show that 3-qudit SU(d)-invariant gates are semi-universal, i.e., generate all SU(d)-invariant unitaries, up to certain constraints on the relative phases between sectors with inequivalent representation of symmetry. Furthermore, we prove that these gates achieve full universality when supplemented with 3 ancilla qudits. Interestingly, we find that studying circuits with 3-qudit gates is also useful for a better understanding of circuits with 2-qudit gates. In particular, we establish that even though 2-qudit SU(d)-invariant gates are not themselves semi-universal, they become universal with at most 11 ancilla qudits. Additionally, we investigate the statistical properties of circuits composed of random SU(d)-invariant gates. Our findings reveal that while circuits with 2-qudit gates do not form a 2-design for the Haar measure over SU(d)-invariant unitaries, circuits with 3-qudit gates generate a t-design, with t that is quadratic in the number of qudits.

quant-ph↗

arXiv2024

Noisy Quantum Trees: Infinite Protection Without Correction

We study quantum networks with tree structures, in which information propagates from a root to leaves. At each node in the network, the received qubit unitarily interacts with fresh ancilla qubits, after which each qubit is sent through a noisy channel to a different node in the next level. Therefore, as the tree depth grows, there is a competition between the irreversible effect of noise and the protection against such noise achieved by delocalization of information. In the classical setting, where each node simply copies the input bit into multiple output bits, this model has been studied as the broadcasting or reconstruction problem on trees, which has broad applications. In this work, we study the quantum version of this problem. We consider a Clifford encoder at each node that encodes the input qubit in a stabilizer code, along with a single qubit Pauli noise channel at each edge. Such noisy quantum trees describe a scenario in which one has access to a stream of fresh (low-entropy) ancilla qubits, but cannot perform error correction. Therefore, they provide a different perspective on quantum fault tolerance. Furthermore, they provide a useful model for describing the effect of noise within the encoders of concatenated codes. We prove that above certain noise thresholds, which depend on the properties of the code such as its distance, as well as the properties of the encoder, information decays exponentially with the depth of the tree. On the other hand, by studying certain efficient decoders, we prove that for codes with distance d>=2 and for sufficiently small (but non-zero) noise, classical information and entanglement propagate over a noisy tree with infinite depth. Indeed, we find that this remains true even for binary trees with certain 2-qubit encoders at each node, which encode the received qubit in the binary repetition code with distance d=1.

quant-ph↗

arXiv2024

Universal Quantum Emulator

We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The algorithm does not assume any prior information about the unitary to be emulated or the sample input states. To emulate the action of the unknown unitary, the new input state is coupled to the given sample input-output pairs in a coherent fashion. Remarkably, the runtime of the algorithm is logarithmic in D, the dimension of the Hilbert space, and increases polynomially with d, the dimension of the subspace spanned by the sample input states. Furthermore, the sample complexity of the algorithm-i.e., the total number of copies of the sample input-output pairs needed to run the algorithm-is independent of D and polynomial in d. In contrast, the runtime and sample complexity of incoherent methods, i.e., methods that use tomography, are both linear in D. The algorithm is blind, in the sense that, at the end, it does not learn anything about the given samples or the emulated unitary. This algorithm can be used as a subroutine in other algorithms, such as quantum phase estimation.

quant-ph↗

arXiv2023

Sufficient statistic and recoverability via Quantum Fisher Information metrics

We prove that for a large class of quantum Fisher information, a quantum channel is sufficient for a family of quantum states, i.e., the input states can be recovered from the output, if and only if the quantum Fisher information is preserved under the quantum channel. This class, for instance, includes Winger-Yanase-Dyson skew information. On the other hand, interestingly, the SLD quantum Fisher information, as the most popular example of quantum analog of Fisher information, does not satisfy this property. Our recoverability result is obtained by studying Riemannian monotone metrics on the quantum state space, i.e. metrics monotone decreasing under the action of quantum channels, a property often called data processing inequality. For two quantum states, the monotone metric gives the corresponding quantum $χ^2$ divergence. We obtain an approximate recovery result in the sense that, if the quantum $χ^2$ divergence is approximately preserved by a quantum channel, then two states can be approximately recovered by the Petz recovery map. We also obtain a universal recovery bound for the $χ_{\frac{1}{2}}$ divergence. Finally, we discuss applications in the context of quantum thermodynamics and the resource theory of asymmetry.

quant-ph↗

arXiv2022

Quantum algorithm for Petz recovery channels and pretty good measurements

The Petz recovery channel plays an important role in quantum information science as an operation that approximately reverses the effect of a quantum channel. The pretty good measurement is a special case of the Petz recovery channel, and it allows for near-optimal state discrimination. A hurdle to the experimental realization of these vaunted theoretical tools is the lack of a systematic and efficient method to implement them. This paper sets out to rectify this lack: using the recently developed tools of quantum singular value transformation and oblivious amplitude amplification, we provide a quantum algorithm to implement the Petz recovery channel when given the ability to perform the channel that one wishes to reverse. Moreover, we prove that, in some sense, our quantum algorithm's usage of the channel implementation cannot be improved by more than a quadratic factor. Our quantum algorithm also provides a procedure to perform pretty good measurements when given multiple copies of the states that one is trying to distinguish.

quant-ph↗

arXiv2022

Rotationally-Invariant Circuits: Universality with the exchange interaction and two ancilla qubits

Universality of local unitary transformations is one of the cornerstones of quantum computing with many applications and implications that go beyond this field. However, it has been recently shown that this universality does not hold in the presence of continuous symmetries: generic symmetric unitaries on a composite system cannot be implemented, even approximately, using local symmetric unitaries on the subsystems [I. Marvian, Nature Physics (2022)]. In this work, we study qubit circuits formed from k-local rotationally-invariant unitaries and fully characterize the constraints imposed by locality on the realizable unitaries. We also present an interpretation of these constraints in terms of the average energy of states with a fixed angular momentum. Interestingly, despite these constraints, we show that, using a pair of ancilla qubits, any rotationally-invariant unitary can be realized with the Heisenberg exchange interaction, which is 2-local and rotationally-invariant. We also show that a single ancilla is not enough to achieve universality. Finally, we discuss applications of these results for quantum computing with semiconductor quantum dots, quantum reference frames, and resource theories.

quant-ph↗

arXiv2022

Qudit circuits with SU(d) symmetry: Locality imposes additional conservation laws

Local symmetric quantum circuits provide a simple framework to study the dynamics and phases of complex quantum systems with conserved charges. However, some of their basic properties have not yet been understood. Recently, it has been shown that such quantum circuits only generate a restricted subset of symmetric unitary transformations [I. Marvian, Nature Physics, 2022]. In this paper, we consider circuits with 2-local SU(d)-invariant unitaries acting on qudits, i.e., d-dimensional quantum systems. Our results reveal a significant distinction between the cases of d = 2 and d>2. For qubits with SU(2) symmetry, arbitrary global rotationally-invariant unitaries can be generated with 2-local ones, up to relative phases between the subspaces corresponding to inequivalent irreducible representations (irreps) of the symmetry, i.e., sectors with different angular momenta. On the other hand, for d>2, in addition to similar constraints on the relative phases between the irreps, locality also restricts the generated unitaries inside these conserved subspaces. These constraints impose conservation laws that hold for dynamics under 2-local SU(d)-invariant unitaries, but are violated under general SU(d)-invariant unitaries. Based on this result, we show that the distribution of unitaries generated by random 2-local SU(d)-invariant unitaries does not converge to the Haar measure over the group of all SU(d)-invariant unitaries, and in fact, for d>2, is not even a 2-design for the Haar distribution.

quant-ph↗

arXiv2021

Operational Interpretation of Quantum Fisher Information in Quantum Thermodynamics

In the framework of quantum thermodynamics preparing a quantum system in a general state requires the consumption of two distinct resources, namely, work and coherence. It has been shown that the work cost of preparing a quantum state is determined by its free energy. Considering a similar setting, here we determine the coherence cost of preparing a general state when there are no restrictions on work consumption. More precisely, the coherence cost is defined as the minimum rate of consumption of systems in a pure coherent state, that is needed to prepare copies of the desired system. We show that the coherence cost of any system is determined by its quantum Fisher information about the time parameter, hence introducing a new operational interpretation of this central quantity of quantum metrology. Our resource-theoretic approach also reveals a previously unnoticed connection between two fundamental properties of quantum Fisher information.

quant-ph↗

arXiv2021

Coherence distillation machines are impossible in quantum thermodynamics

The role of coherence in quantum thermodynamics has been extensively studied in the recent years and it is now well-understood that coherence between different energy eigenstates is a resource independent of other thermodynamics resources, such as work. A fundamental remaining open question is whether the laws of quantum mechanics and thermodynamics allow the existence of a coherence distillation machine, i.e., a machine that, by possibly consuming work, obtains pure coherent states from mixed states, at a nonzero rate. This is related to another fundamental question: Starting from many copies of noisy quantum clocks which are (approximately) synchronized with a reference clock, can one distill synchronized clocks in pure states, at a non-zero rate? Surprisingly, we find that the answer to both questions is negative for generic (full-rank) mixed states. However, at the same time, it is possible to distill a sub-linear number of pure coherent states with a vanishing error.

quant-ph↗

arXiv2020

Programming a quantum computer with quantum instructions

The equivalence between the instructions used to define programs and the input data on which the instructions operate is a basic principle of classical computer architectures and programming. Replacing classical data with quantum states enables fundamentally new computational capabilities with scaling advantages for many applications, and numerous models have been proposed for realizing quantum computation. However, within each of these models, the quantum data are transformed by a set of gates that are compiled using solely classical information. Conventional quantum computing models thus break the instruction-data symmetry: classical instructions and quantum data are not directly interchangeable. In this work, we use a density matrix exponentiation protocol to execute quantum instructions on quantum data. In this approach, a fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. Our demonstration relies on a 99.7% fidelity controlled-phase gate implemented using two tunable superconducting transmon qubits, which enables an algorithmic fidelity surpassing 90% at circuit depths exceeding 70. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation, thereby enabling exponential speedup for a broad range of algorithms, including quantum principal component analysis, the measurement of entanglement spectra, and universal quantum emulation.

quant-ph↗

arXiv2020

A no-broadcasting theorem for quantum asymmetry and coherence and a trade-off relation for approximate broadcasting

Symmetries of both closed and open-system dynamics imply many significant constraints. These generally have instantiations in both classical and quantum dynamics (Noether's theorem, for instance, applies to both sorts of dynamics). We here provide an example of such a constraint which has no counterpart for a classical system, that is, a uniquely quantum consequence of symmetric dynamics. Specifically, we demonstrate the impossibility of broadcasting asymmetry (symmetry-breaking) relative to a continuous symmetry group, for bounded-size quantum systems. The no-go theorem states that if two initially uncorrelated systems interact by symmetric dynamics and asymmetry is created at one subsystem, then the asymmetry of the other subsystem must be reduced. We also find a quantitative relation describing the tradeoff between the subsystems. These results cannot be understood in terms of additivity of asymmetry, because, as we show here, any faithful measure of asymmetry violates both sub-additivity and super-additivity. Rather, they must be understood as a consequence of an (intrinsically quantum) information-disturbance principle. Our result also implies that if a bounded-size quantum reference frame for the symmetry group, or equivalently, a bounded-size reservoir of coherence (e.g., a clock with coherence between energy eigenstates in quantum thermodynamics) is used to implement any operation that is not symmetric, then the quantum state of the frame/reservoir is necessarily disturbed in an irreversible fashion, i.e., degraded.

quant-ph↗

arXiv2020

Inaccessible information in probabilistic models of quantum systems, non-contextuality inequalities and noise thresholds for contextuality

Classical probabilistic models of (noisy) quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources for information processing tasks. A common feature of these models is the presence of inaccessible information, as captured by the concept of preparation contextuality: There are ensembles of quantum states described by the same density operator, and hence operationally indistinguishable, and yet in any probabilistic (ontological) model, they should be described by distinct probability distributions. In this work, we quantify the inaccessible information of a model in terms of the maximum distinguishability of probability distributions associated to any pair of ensembles with identical density operators, as quantified by the total variation distance of the distributions. We obtain a family of lower bounds on this maximum distinguishability in terms of experimentally measurable quantities. In the case of an ideal qubit this leads to a lower bound of, approximately, 0.07. These bounds can also be interpreted as a new class of robust preparation non-contextuality inequalities. Our non-contextuality inequalities are phrased in terms of generalizations of max-relative entropy and trace distance for general operational theories, which could be of independent interest. Under sufficiently strong noise any quantum system becomes preparation non-contextual, i.e., can be described by models with zero inaccessible information. Using our non-contextuality inequalities, we show that this can happen only if the noise channel has the average gate fidelity less than or equal to 1/D(1+1/2+...+1/D), where D is the dimension of the Hilbert space.

quant-ph↗

arXiv2019

Entropic Energy-Time Uncertainty Relation

Energy-time uncertainty plays an important role in quantum foundations and technologies, and it was even discussed by the founders of quantum mechanics. However, standard approaches (e.g., Robertson's uncertainty relation) do not apply to energy-time uncertainty because, in general, there is no Hermitian operator associated with time. Following previous approaches, we quantify time uncertainty by how well one can read off the time from a quantum clock. We then use entropy to quantify the information-theoretic distinguishability of the various time states of the clock. Our main result is an entropic energy-time uncertainty relation for general time-independent Hamiltonians, stated for both the discrete-time and continuous-time cases. Our uncertainty relation is strong, in the sense that it allows for a quantum memory to help reduce the uncertainty, and this formulation leads us to reinterpret it as a bound on the relative entropy of asymmetry. Due to the operational relevance of entropy, we anticipate that our uncertainty relation will have information-processing applications.

quant-ph↗

arXiv2018

Emergent prethermalization signatures in out-of-time ordered correlations

How a many-body quantum system thermalizes --or fails to do so-- under its own interaction is a fundamental yet elusive concept. Here we demonstrate nuclear magnetic resonance observation of the emergence of prethermalization by measuring out-of-time ordered correlations. We exploit Hamiltonian engineering techniques to tune the strength of spin-spin interactions and of a transverse magnetic field in a spin chain system, as well as to invert the Hamiltonian sign to reveal out-of-time ordered correlations. At large fields, we observe an emergent conserved quantity due to prethermalization, which can be revealed by an early saturation of correlations. Our experiment not only demonstrates a new protocol to measure out-of-time ordered correlations, but also provides new insights in the study of quantum thermodynamics.

quant-ph↗

arXiv2017

Quantum majorization and a complete set of entropic conditions for quantum thermodynamics

What does it mean for one quantum process to be more disordered than another? Here we provide a precise answer to this question in terms of a quantum-mechanical generalization of majorization. The framework admits a complete description in terms of single-shot entropies, and provides a range of significant applications. These include applications to the comparison of quantum statistical models and quantum channels, to the resource theory of asymmetry, and to quantum thermodynamics. In particular, within quantum thermodynamics, we apply our results to provide the first complete set of of necessary and sufficient conditions for arbitrary quantum state transformation under thermodynamic processes, and which rigorously accounts for quantum-mechanical properties, such as coherence. Our framework of generalized thermal processes extends thermal operations, and is based on natural physical principles, namely, energy conservation, the existence of equilibrium states, and the requirement that quantum coherence be accounted for thermodynamically. In the zero coherence case we recover thermo-majorization while in the asymptotic coherence regime we obtain a constraint that takes the form of a Page-Wootters clock condition.

quant-ph↗