arXiv subjects

Mark S. Byrd

Publications and source records attributed to Mark S. Byrd.

At least 19 recordsLinked to original sources

arXiv2024

Going beyond quantum Markovianity and back to reality: An exact master equation study

The precise characterization of dynamics in open quantum systems often presents significant challenges, leading to the introduction of various approximations to simplify a model. One commonly used strategy involves Markovian approximations, assuming a memoryless environment. In this study, such approximations are not used and an analytical dynamical depiction of an open quantum system is provided. The system under consideration is an oscillator that is surrounded by a bath of oscillators. The resulting dynamics are characterized by a second-order complex coefficient linear differential equation, which may be either homogeneous or inhomogeneous. Moreover, distinct dynamical regions emerge, depending on certain parameter values. Notably, the steady-state average excitation number (AEN) of the system shows rapid escalation with increasing non-Markovianity, reflecting the intricacies of real-world dynamics. In cases where there is detuning between the system frequency and the environmental central frequency within a non-Markovian regime, the AEN maintains its initial value for an extended period. Furthermore, the application of pulse control can effectively protect the quantum system from decoherence effects without using approximations. The pulse control can not only prolong the relaxation time of the oscillator, but can also be used to speed up the relaxation process, depending on the specifications of the pulse. By employing a kick pulse, the Mpemba effect can be observed in the non-Markovian regime in a surprisingly super-cooling-like effect.

quant-ph↗

arXiv2023

Hybrid noise protection of logical qubits for universal quantum computation

Quantum computers now show the promise of surpassing any possible classical machine. However, errors limit this ability and current machines do not have the ability to implement error correcting codes due to the limited number of qubits and limited control. Therefore, dynamical decoupling (DD) and encodings that limit noise with fewer qubits are more promising. For these reasons, we put forth a model of universal quantum computation that has many advantages over strategies that require a large overhead such as the standard quantum error correcting codes. First, we separate collective noise from individual noises on physical qubits and use a decoherence-free subspace (DFS) that uses just two qubits for its encoding to eliminate collective noise. Second, our bath model is very general as it uses a spin-boson type bath but without any Markovian assumption. Third, we are able to either use a steady global magnetic field or to devise a set of DD pulses that remove much of the remaining noise and commute with the logical operations on the encoded qubit. This allows removal of noise while implementing gate operations. Numerical support is given for this hybrid protection strategy which provides an efficient approach to deal with the decoherence problems in quantum computation and is experimentally viable for several current quantum computing systems. This is emphasized by a recent experiment on superconducting qubits which shows promise for increasing the number of gates that can be implemented reliably with some realistic parameter assumptions.

quant-ph↗

arXiv2023

Modularized and Scalable Compilation for Double Quantum Dot Quatum Computing

Any quantum program on a realistic quantum device must be compiled into an executable form while taking into account the underlying hardware constraints. Stringent restrictions on architecture and control imposed by physical platforms make this very challenging. In this paper, based on the quantum variational algorithm, we propose a novel scheme to train an Ansatz circuit and realize high-fidelity compilation of a set of universal quantum gates for singlet-triplet qubits in semiconductor double quantum dots, a fairly heavily constrained system. Furthermore, we propose a scalable architecture for a modular implementation of quantum programs in this constrained systems and validate its performance with two representative demonstrations, Grover's algorithm for the database searching (static compilation) and a variant of variational quantum eigensolver for the Max-Cut optimization (dynamic compilation). Our methods are potentially applicable to a wide range of physical devices. This work constitutes an important stepping-stone for exploiting the potential for advanced and complicated quantum algorithms on near-term devices.

quant-ph↗

arXiv2021

Nonequilibrium Quantum Thermodynamics in Non-Markovian Adiabatic Speedup

Understanding heat transfer between a quantum system and its environment is of undisputed importance if reliable quantum devices are to be constructed. Here, we investigate the heat transfer between system and bath in non-Markovian open systems in the process of adiabatic speedup. Using the quantum state diffusion equation method, the heat current, energy current, and power are calculated during free evolution and under external control of the system. While the heat current increases with increasing system-bath coupling strength and bath temperature, it can be restricted by the non-Markovian nature of the bath. Without pulse control, the heat current is nearly equal to the energy current. On the other hand, with pulse control, the energy current turns out to be nearly equal to the power. In this scenario, we show that non-Markovianity is a useful tool to drive the system through an approximate adiabatic dynamics, with pulse control acting in the conversion between heat current and power throughout the evolution.

quant-ph↗

arXiv2020

Sufficient Conditions and Constraints for Reversing General Quantum Errors

Reversing the effects of a quantum evolution, for example as is done in error correction, is an important task for controlling quantum systems in order to produce reliable quantum devices. When the evolution is governed by a completely positive map, there exist reversibility conditions, known as the quantum error correcting code conditions, which are necessary and sufficient conditions for the reversibility of a quantum operation on a subspace, the code space. However, if we suppose that the evolution is not described by a completely positive map, necessary and sufficient conditions are not known. Here we consider evolutions that do not necessarily correspond to a completely positive map. We prove that the completely positive map error correcting code conditions can lead to a code space that is not in the domain of the map, meaning that the output of the map is not positive. A corollary to our theorem provides a class of relevant examples. Finally, we provide a set of sufficient conditions that will enable the use of quantum error correcting code conditions while ensuring positivity.

quant-ph↗

arXiv2020

Nonperturbative leakage elimination for a logical qubit encoded in a mechanical oscillator

Continuous-variable (CV) systems are attracting increasing attention in the realization of universal quantum computation. Several recent experiments have shown the feasibility of using CV systems to, e.g., encode a qubit into a trapped-ion mechanical oscillator and perform logic gates [Nature 566, 513-517 (2019)]. The essential next step is to protect the encoded qubit from quantum decoherence, e.g., the motional decoherence due to the interaction between a mechanical oscillator and its environment. Here we propose a scheme to suppress quantum decoherence of a single-mode harmonic oscillator used to encode qubits by introducing a nonperturbative leakage elimination operator (LEO) specifically designed for this purpose. Remarkably, our nonperturbative LEO can be used to analytically derive exact equations of motion without approximations. It also allows us to prove that the effectiveness of these LEOs only depends on the integral of the pulse sequence in the time domain, while details of the pulse shape does not make a significant difference when the time period is chosen appropriately. This control method can be applied to a system at an arbitrary temperature and arbitrary system-bath coupling strength which makes it extremely useful for general open quantum systems.

quant-ph↗

arXiv2018

Adiabatic Quantum Simulation Using Trotterization

As first proposed for the adiabatic quantum information processing by Wu, Byrd and Lidar [ Phys. Rev. Lett. 89, 057904 (2002)], the Trotterization technique is a very useful tool for universal quantum computing, and in particular, the adiabatic quantum simulation of quantum systems. Given a boson Hamiltonian involving arbitrary bilinear interactions, we propose a static version of this technique to perform an optical simulation that would enable the identification of the ground state of the Hamiltonian. By this method, the dynamical process of the adiabatic evolution is mapped to a static linear optical array which avoids the errors caused by dynamical fluctuations. We examine the cost of the physical implementation of the Trotterization, i.e. the number of discrete steps required for a given accuracy. Two conclusions are drawn. One is that number of required steps grows much more slowly than system size if the number of the non-zero matrix elements of Hamiltonian is not too large. The second is that the fluctuation of the parameters of optical elements does not affect the first conclusion. This implies that the method is robust against errors.

quant-ph↗

arXiv2016

Creating Quantum Cluster States embedded in ancillary baths

We propose a systematic and explicit method for the inverse engineering of the dynamics of an open quantum systems with no auxiliary Hamiltonian nor the prerequisite of adiabatic passage. In particular, we exploit the Lindblad dissipators in order to create a resource state or subspace of interest in the presence of decoherence. In a conceptual shift, the Lindblad dissipators, including multiple interactions that are central to determine the steady state in the long-time limit for an open quantum system, can be guided to produce a useful practical resource to achieve an arbitrary target state or subspace. More importantly, with the help of gate and circuit-based quantum control, we provide an explicit, programmable, and polynomially efficient control sequence to create a cluster state or graph state useful for one-way quantum computing.

quant-ph↗

arXiv2014

Fault-tolerant breathing pattern in optical lattices as a dynamical quantum memory

Proposals for quantum information processing often require the development of new quantum tech- nologies. However, here we build quantum memory by ultracold atoms in one-dimensional optical lattices with existing state-of-the-art technology. Under a parabolic external field, we demonstrate that an arbitrary initial state at an end of the optical lattices can time-evolve and revive, with very high fidelity, at predictable discrete time intervals. Physically, the parabolic field, can catalyze a breathing pattern. The initial state is memorized by the pattern and can be retrieved at any of the revival time moments. In comparison with usual time-independent memory, we call this a dynamical memory. Furthermore, we show that the high fidelity of the quantum state at revival time moments is fault-tolerant against the fabrication defects and even time-dependent noise.

quant-ph↗

arXiv2013

Heralding an Arbitrary Decoherence-Free Qubit State

We present an optical device which is capable of heralding a variety of DFS states which protect against collective noise. Specifically, it can prepare all three basis states which span a DFS qutrit as well as an arbitrarily encoded DFS qubit state. We also discuss an interferometric technique for determining the amplitudes associated with an arbitrary encoding. The heralded state may find use in coherent optical systems which exhibit collective correlations.

quant-ph↗

arXiv2012

Quantum states experimentally achieving high-fidelity transmission over a spin chain

A uniformly coupled double quantum Hamiltonian for a spin chain has recently been implemented experimentally. We propose a method for the determination of initial quantum states that will provide perfect or near-perfect state transmission for an arbitrary Hamiltonian including this one. By calculating the eigenvalues and eigenvectors of a unitary operator obtained from the free evolution plus an exchange operator, we find that the double quantum Hamiltonian spin chain will support a three-spin initial encoding that will transfer along the chain with remarkably high fidelity. The fidelity is also found to decrease very slowly with increasing chain length. In addition, we are able to explain previous results showing exceptional transfer using this method.

quant-ph↗

arXiv2012

Effects of Noise, Correlations and errors in the preparation of initial states in Quantum Simulations

In principle a quantum system could be used to simulate another quantum system. The purpose of such a simulation would be to obtain information about problems which cannot be simulated with a classical computer due to the exponential increase of the Hilbert space with the size of the system and which cannot be measured or controlled in an actual experiment. The system will interact with the surrounding environment, with the other particles in the system and be implemented using imperfect controls making it subject to noise. It has been suggested that noise does not need to be controlled to the same extent as it must be for general quantum computing. However the effects of noise in quantum simulations and how to treat them are not completely understood. In this paper we study an existing quantum algorithm for the one-dimensional Fano-Anderson model to be simulated using a liquid-state NMR device. We calculate the evolution of different initial states in the original model, and then we add interacting spins to simulate a more realistic situation. We find that states which are entangled with their environment, and sometimes correlated but not necessarily entangled have an evolution which is described by maps which are not completely positive. We discuss the conditions for this to occur and also the implications.

quant-ph↗

arXiv2011

Geometric phases in dressed state quantum computation

Geometric phases arise naturally in a variety of quantum systems with observable consequences. They also arise in quantum computations when dressed states are used in gating operations. Here we show how they arise in these gating operations and how one may take advantage of the dressed states producing them. Specifically, we show that that for a given, but arbitrary Hamiltonian, and at an arbitrary time τ, there always exists a set of dressed states such that a given gate operation can be performed by the Hamiltonian up to a phase ϕ. The phase is a sum of a dynamical phase and a geometric phase. We illustrate the new phase for several systems.

quant-ph↗

arXiv2010

Affine Maps of the Polarization Vector for Quantum Systems of Arbitrary Dimension

The operator-sum decomposition (OS) of a mapping from one density matrix to another has many applications in quantum information science. To this mapping there corresponds an affine map which provides a geometric description of the density matrix in terms of the polarization vector representation. This has been thoroughly explored for qubits since the components of the polarization vector are measurable quantities (corresponding to expectation values of Hermitian operators) and also because it enables the description of map domains geometrically. Here we extend the OS-affine map correspondence to qudits, briefly discuss general properties of the map, the form for particular important cases, and provide several explicit results for qutrit maps. We use the affine map and a singular-value-like decomposition, to find positivity constraints that provide a symmetry for small polarization vector magnitudes (states which are closer to the maximally mixed state) which is broken as the polarization vector increases in magnitude (a state becomes more pure). The dependence of this symmetry on the magnitude of the polarization vector implies the polar decomposition of the map can not be used as it can for the qubit case. However, it still leads us to a connection between positivity and purity for general d-state systems.

quant-ph↗

arXiv2010

High Fidelity State Transfer Over an Unmodulated Linear XY Spin Chain

We provide a class of initial encodings that can be sent with a high fidelity over an unmodulated, linear, XY spin chain. As an example, an average fidelity of ninety-six percent can be obtained using an eleven-spin encoding to transmit a state over a chain containing ten-thousand spins. An analysis of the magnetic field dependence is given, and conditions for field optimization are provided.

quant-ph↗

arXiv2010

Sufficient conditions placed on initial system-environment states for positive maps

A system interacting with its environment will give rise to a quantum evolution. After tracing over the environment the net evolution of the system can be described by a linear Hermitian map. It has recently been shown that a necessary and sufficient condition for this evolution to be completely positive is for the initial state to have vanishing quantum discord. In this paper, we provide a sufficient condition for the map to be positive with respect to the initial system-environment correlation. This could lead to ways in which to identify positive but not completely positive maps. Illustrative examples and suggestive procedures are also provided.

quant-ph↗

arXiv2010

All maps equivalent to a given map, completely positive or not

A dynamical map is a map which takes one density operator to another. Such a map can be written in an operator-sum representation (OSR) using a spectral decomposition. The method of the construction applies to more general maps which need not be completely positive. The OSR not unique; there is a freedom to choose the set of operators in the OSR differently, yet still obtain the same map. Here we identify all maps which are equivalent to a given map. Whereas the freedom for completely positive maps is unitary, the freedom for maps which are not necessarily completely positive is pseudo-unitary.

quant-ph↗

arXiv2010

Computable constraints on entanglement-sharing of multipartite quantum states

Negativity is regarded as an important measure of entanglement in quantum information theory. In contrast to other measures of entanglement, it is easily computable for bipartite states in arbitrary dimensions. In this paper, based on the negativity and realignment, we provide a set of entanglement-sharing constraints for multipartite states, where the entanglement is not necessarily limited to bipartite and pure states, thus aiding in the quantification of constraints for entanglement-sharing. These may find applications in studying many-body systems.

quant-ph↗