arXiv subjects

D. Bacon

Publications and source records attributed to D. Bacon.

212 records · Page 12Linked to original sources

arXiv2008

Obscured star formation in intermediate-density environments: A Spitzer study of the Abell 901/902 supercluster

We explore the amount of obscured star-formation as a function of environment in the A901/902 supercluster at z=0.165 in conjunction with a field sample drawn from the A901 and CDFS fields, imaged with HST as part of the STAGES and GEMS surveys. We combine the COMBO-17 near-UV/optical SED with Spitzer 24um photometry to estimate both the unobscured and obscured star formation in galaxies with Mstar>10^{10}Msun. We find that the star formation activity in massive galaxies is suppressed in dense environments, in agreement with previous studies. Yet, nearly 40% of the star-forming galaxies have red optical colors at intermediate and high densities. These red systems are not starbursting; they have star formation rates per unit stellar mass similar to or lower than blue star-forming galaxies. More than half of the red star-forming galaxies have low IR-to-UV luminosity ratios, relatively high Sersic indices and they are equally abundant at all densities. They might be gradually quenching their star-formation, possibly but not necessarily under the influence of gas-removing environmental processes. The other >40% of the red star-forming galaxies have high IR-to-UV luminosity ratios, indicative of high dust obscuration. They have relatively high specific star formation rates and are more abundant at intermediate densities. Our results indicate that while there is an overall suppression in the star-forming galaxy fraction with density, the small amount of star formation surviving the cluster environment is to a large extent obscured, suggesting that environmental interactions trigger a phase of obscured star formation, before complete quenching.

astro-ph↗

arXiv2008

Simon's Algorithm, Clebsch-Gordan Sieves, and Hidden Symmetries of Multiple Squares

The first quantum algorithm to offer an exponential speedup (in the query complexity setting) over classical algorithms was Simon's algorithm for identifying a hidden exclusive-or mask. Here we observe how part of Simon's algorithm can be interpreted as a Clebsch-Gordan transform. Inspired by this we show how Clebsch-Gordan transforms can be used to efficiently find a hidden involution on the group G^n where G is the dihedral group of order eight (the group of symmetries of a square.) This problem previously admitted an efficient quantum algorithm but a connection to Clebsch-Gordan transforms had not been made. Our results provide further evidence for the usefulness of Clebsch-Gordan transform in quantum algorithm design.

quant-ph↗

arXiv2008

The Stability of Quantum Concatenated Code Hamiltonians

Protecting quantum information from the detrimental effects of decoherence and lack of precise quantum control is a central challenge that must be overcome if a large robust quantum computer is to be constructed. The traditional approach to achieving this is via active quantum error correction using fault-tolerant techniques. An alternative to this approach is to engineer strongly interacting many-body quantum systems that enact the quantum error correction via the natural dynamics of these systems. Here we present a method for achieving this based on the concept of concatenated quantum error correcting codes. We define a class of Hamiltonians whose ground states are concatenated quantum codes and whose energy landscape naturally causes quantum error correction. We analyze these Hamiltonians for robustness and suggest methods for implementing these highly unnatural Hamiltonians.

quant-ph↗

arXiv2008

Characterizing Barred Galaxies in the Abell 901/902 Supercluster

In dense clusters, higher densities at early epochs as well as physical processes, such as ram pressure stripping and tidal interactions become important, and can have direct consequences for the evolution of bars and their host disks. To study bars and disks as a function of environment, we are using the STAGES ACS HST survey of the Abell 901/902 supercluster (z~0.165), along with earlier field studies based the SDSS and the Ohio State University Bright Spiral Galaxy Survey (OSUBSGS). We explore the limitations of traditional methods for characterizing the bar fraction, and in particular highlight uncertainties in disk galaxy selection in cluster environments. We present an alternative approach for exploring the proportion of bars, and investigate the properties of bars as a function of host galaxy color, Sersic index, stellar mass, star formation rate (SFR), specific SFR, and morphology.

astro-ph↗

arXiv2003

The Communication Cost of Simulating Bell Correlations

What classical resources are required to simulate quantum correlations? For the simplest and most important case of local projective measurements on an entangled Bell pair state, we show that exact simulation is possible using local hidden variables augmented by just one bit of classical communication. Certain quantum teleportation experiments, which teleport a single qubit, therefore admit a local hidden variables model.

quant-ph↗

arXiv2003

Decoherence, Control, and Symmetry in Quantum Computers

In this thesis we describe methods for avoiding the detrimental effects of decoherence while at the same time still allowing for computation of the quantum information. The philosophy of the method discussed in the first part of this thesis is to use a symmetry of the decoherence mechanism to find robust encodings of the quantum information. Stability, control, and methods for using decoherence-free information in a quantum computer are presented with a specific emphasis on decoherence due to a collective coupling between the system and its environment. Universal quantum computation on such collective decoherence decoherence-free encodings is demonstrated. Rigorous definitions of control and the use of encoded universality in quantum computers are addressed. Explicit gate constructions for encoded universality on ion trap and exchange based quantum computers are given. In the second part of the thesis we examine physical systems with error correcting properties. We examine systems that can store quantum information in their ground state such that decoherence processes are prohibited via energetics. We present the theory of supercoherent systems whose ground states are quantum error detecting codes and describe a spin ladder whose ground state has both the error detecting and correcting properties. We conclude by discussing naturally fault-tolerant quantum computation.

quant-ph↗

arXiv2003

Bell Inequalities with Auxiliary Communication

What is the communication cost of simulating the correlations produced by quantum theory? We generalize Bell inequalities to the setting of local realistic theories augmented by a fixed amount of classical communication. Suppose two parties choose one of M two-outcome measurements and exchange 1 bit of information. We present the complete set of inequalities for M = 2, and the complete set of inequalities for the joint correlation observable for M = 3. We find that correlations produced by quantum theory satisfy both of these sets of inequalities. One bit of communication is therefore sufficient to simulate quantum correlations in both of these scenarios.

quant-ph↗

arXiv2002

Coherence-Preserving Quantum Bits

Real quantum systems couple to their environment and lose their intrinsic quantum nature through the process known as decoherence. Here we present a method for minimizing decoherence by making it energetically unfavorable. We present a Hamiltonian made up solely of two-body interactions between four two-level systems (qubits) which has a two-fold degenerate ground state. This degenerate ground state has the property that any decoherence process acting on an individual physical qubit must supply energy from the bath to the system. Quantum information can be encoded into the degeneracy of the ground state and such coherence-preserving qubits will then be robust to local decoherence at low bath temperatures. We show how this quantum information can be universally manipulated and indicate how this approach may be applied to a quantum dot quantum computer.

quant-ph↗

arXiv2002

Universal Quantum Computation with the Exchange Interaction

Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is daunting, involving capabilities well beyond the present state of the art. In this report we develop a significant simplification of these requirements that can be applied in many recent solid-state approaches, using quantum dots [2], and using donor-atom nuclear spins [3] or electron spins [4]. In these approaches, the basic two-qubit quantum gate is generated by a tunable Heisenberg interaction (the Hamiltonian is $H_{ij}=J(t){\vec S}_i\cdot{\vec S}_j$ between spins $i$ and $j$), while the one-qubit gates require the control of a local Zeeman field. Compared to the Heisenberg operation, the one-qubit operations are significantly slower and require substantially greater materials and device complexity, which may also contribute to increasing the decoherence rate. Here we introduce an explicit scheme in which the Heisenberg interaction alone suffices to exactly implement any quantum computer circuit, at a price of a factor of three in additional qubits and about a factor of ten in additional two-qubit operations. Even at this cost, the ability to eliminate the complexity of one-qubit operations should accelerate progress towards these solid-state implementations of quantum computation.

quant-ph↗

arXiv2001

Encoded Universality from a Single Physical Interaction

We present a theoretical analysis of the paradigm of encoded universality, using a Lie algebraic analysis to derive specific conditions under which physical interactions can provide universality. We discuss the significance of the tensor product structure in the quantum circuit model and use this to define the conjoining of encoded qudits. The construction of encoded gates between conjoined qudits is discussed in detail. We illustrate the general procedures with several examples from exchange-only quantum computation. In particular, we extend our earlier results showing universality with the isotropic exchange interaction to the derivation of encoded universality with the anisotropic exchange interaction, i.e., to the XY model. In this case the minimal encoding for universality is into qutrits rather than into qubits as was the case for isotropic (Heisenberg) exchange. We also address issues of fault-tolerance, leakage and correction of encoded qudits.

quant-ph↗

arXiv2001

Encoded Universality in Physical Implementations of a Quantum Computer

We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the intrinsic ability of a system to act as a universal quantum computer using only its naturally available interactions. A key element of this approach is the realization that the fungible nature of quantum information allows for universal manipulations using quantum information encoded in a subspace of the full system Hilbert space, as an alternative to using physical qubits directly. Starting with the interactions intrinsic to the physical system, we show how to determine the possible universality resulting from these interactions over an encoded subspace. We outline a general Lie-algebraic framework which can be used to find the encoding for universality and give several examples relevant to solid-state quantum computing.

quant-ph↗

arXiv1999

Robustness of Decoherence-Free Subspaces for Quantum Computation

It was shown recently [D.A. Lidar et al., Phys. Rev. Lett. 81, 2594 (1998)] that within the framework of the semigroup Markovian master equation, decoherence-free (DF) subspaces exist which are stable to first order in time to a perturbation. Here this result is extended to the non-Markovian regime and generalized. In particular, it is shown that within both the semigroup and the non-Markovian operator sum representation, DF subspaces are stable to all orders in time to a symmetry-breaking perturbation. DF subspaces are thus ideal for quantum memory applications. For quantum computation, however, the stability result does not extend beyond the first order. Thus, to perform robust quantum computation in DF subspaces, they must be supplemented with quantum error correcting codes.

quant-ph↗

arXiv1999

Concatenating Decoherence Free Subspaces with Quantum Error Correcting Codes

An operator sum representation is derived for a decoherence-free subspace (DFS) and used to (i) show that DFSs are the class of quantum error correcting codes (QECCs) with fixed, unitary recovery operators, and (ii) find explicit representations for the Kraus operators of collective decoherence. We demonstrate how this can be used to construct a concatenated DFS-QECC code which protects against collective decoherence perturbed by independent decoherence. The code yields an error threshold which depends only on the perturbing independent decoherence rate.

quant-ph↗

arXiv1996

Close Approach during Hard Binary--Binary Scattering

We report on an extensive series of numerical experiments of binary--binary scattering, analysing the cross--section for close approach during interactions for a range of hard binary parameters of interest in globular cluster cores. We consider the implied rate for tidal interactions for different globular clusters and compare our results with previous, complementary estimates of stellar collision rates in globular clusters. We find that the collision rate for binary--binary encounters dominates in low density clusters if the binary fraction in the cluster is larger than $0.2$ for wide main--sequence binaries. In dense clusters binary--single interactions dominate the collision rate and the core binary fraction must be $\ltorder 0.1$ per decade in semi--major axis or too many collisions take place compared to observations. The rates are consistent if binaries with semi--major axes $\sim 100 AU$ are overabundant in low density clusters or if breakup and ejection substantially lowers the binary fraction in denser clusters. Given reasonable assumptions about fractions of binaries in the cores of low density clusters such as NGC~5053, we cannot account for all the observed blue stragglers by stellar collisions during binary encounters, suggesting a substantial fraction may be due to coalescence of tight primordial binaries.

astro-ph↗