Search arXiv⌕ Search

arXiv subjects

Zhao Zhang

Publications and source records attributed to Zhao Zhang.

At least 307 records · Page 17Linked to original sources
arXiv2016

Deformed Fredkin Spin Chain with Extensive Entanglement

We introduce a new spin chain which is a deformation of the Fredkin spin chain and has a phase transition between bounded and extensive entanglement entropy scaling. In this chain, spins have a local interaction of three nearest neighbors. The Hamiltonian is frustration-free and its ground state can be described analytically as a weighted superposition of Dyck paths. In the purely spin $1/2$ case, the entanglement entropy obeys an area law: it is bounded from above by a constant, when the size of the block $n$ increases (and $t>1$). When a local color degree of freedom is introduced the entanglement entropy increases linearly with the size of the block (and $t>1$). The entanglement entropy of half of the chain is tightly bounded by ${ n}\log s$ where $n$ is the size of the block, and $s$ is the number of colors. Our chain fosters a new example for a significant boost to entropy and for the existence of the associated critical rainbow phase where the entanglement entropy scales with volume that has recently been discovered in Zhang et al. (arXiv:1606.07795)

cond-mat.stat-mech↗
arXiv2016

Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set

To achieve an efficient routing in a wireless sensor network, connected dominating set (CDS) is used as virtual backbone. A fault-tolerant virtual backbone can be modeled as a $(k,m)$-CDS. For a connected graph $G=(V,E)$ and two fixed integers $k$ and $m$, a node set $C\subseteq V$ is a $(k,m)$-CDS of $G$ if every node in $V\setminus C$ has at least $m$ neighbors in $C$, and the subgraph of $G$ induced by $C$ is $k$-connected. Previous to this work, approximation algorithms with guaranteed performance ratio in a general graph were know only for $k\leq 3$. This paper makes a significant progress by presenting a $(2k-1)α_0$ approximation algorithm for general $k$ and $m$ with $m\geq k$, where $α_0$ is the performance ratio for the minimum CDS problem. Using currently best known ratio for $α_0$, our algorithm has performance ratio $O(\lnΔ)$, where $Δ$ is the maximum degree of the graph.

cs.DM↗
arXiv2016

A simple setup to measure muon lifetime and electron energy spectrum of muon decay and its Monte Carlo simulation

We designed a simple setup to measure the muon lifetime and the electron energy spectra of muon decay. A low cost coincidental circuit was designed to select the signals of muon decay events detected by a plastic scintillator detector. It triggered a digital oscilloscope to record the signals of muon decay events for measuring the muon lifetime and electron energy spectrum. A Landau-distribution energy loss method was introduced to conduct the energy calibration of the system. The experimental results were well reproduced by the Monte Carlo simulation. The software and hardware of the system are completely open to students, thus more helpful for instruction and motivation.

physics.ins-det↗
arXiv2016

Quantum phase transition from bounded to extensive entanglement entropy in a frustration-free spin chain

We introduce a continuous family of frustration-free Hamiltonians with exactly solvable ground states. We prove that the {ground state of our model is non-degenerate and exhibits} a novel quantum phase transition from bounded entanglement entropy to a massively entangled state with volume entropy scaling. The ground state may be interpreted as a deformation away from the uniform superposition of colored Motzkin paths, showed by Movassagh and Shor to have a large (square-root) but sub-extensive scaling of entanglement into a state with an extensive entropy.

quant-ph↗
arXiv2016

Scientific Computing Meets Big Data Technology: An Astronomy Use Case

Scientific analyses commonly compose multiple single-process programs into a dataflow. An end-to-end dataflow of single-process programs is known as a many-task application. Typically, tools from the HPC software stack are used to parallelize these analyses. In this work, we investigate an alternate approach that uses Apache Spark -- a modern big data platform -- to parallelize many-task applications. We present Kira, a flexible and distributed astronomy image processing toolkit using Apache Spark. We then use the Kira toolkit to implement a Source Extractor application for astronomy images, called Kira SE. With Kira SE as the use case, we study the programming flexibility, dataflow richness, scheduling capacity and performance of Apache Spark running on the EC2 cloud. By exploiting data locality, Kira SE achieves a 2.5x speedup over an equivalent C program when analyzing a 1TB dataset using 512 cores on the Amazon EC2 cloud. Furthermore, we show that by leveraging software originally designed for big data infrastructure, Kira SE achieves competitive performance to the C implementation running on the NERSC Edison supercomputer. Our experience with Kira indicates that emerging Big Data platforms such as Apache Spark are a performant alternative for many-task scientific applications.

cs.DC↗
arXiv2016

Integrating Abstractions to Enhance the Execution of Distributed Applications

One of the factors that limits the scale, performance, and sophistication of distributed applications is the difficulty of concurrently executing them on multiple distributed computing resources. In part, this is due to a poor understanding of the general properties and performance of the coupling between applications and dynamic resources. This paper addresses this issue by integrating abstractions representing distributed applications, resources, and execution processes into a pilot-based middleware. The middleware provides a platform that can specify distributed applications, execute them on multiple resource and for different configurations, and is instrumented to support investigative analysis. We analyzed the execution of distributed applications using experiments that measure the benefits of using multiple resources, the late-binding of scheduling decisions, and the use of backfill scheduling.

cs.DC↗
arXiv2015

Coupled wire model of symmetric Majorana surfaces of topological superconductors

Time reversal symmetric topological superconductors in three spatial dimensions carry gapless surface Majorana fermions. They are robust against any time reversal symmetric single-body perturbation weaker than the bulk energy gap. We mimic the massless surface Majorana's by coupled wire models in two spatial dimensions. We introduce explicit many-body interwire interactions that preserve time reversal symmetry and give energy gaps to all low energy degrees of freedom. We show the gapped models generically carry non-trivial topological order and support anyonic excitations.

cond-mat.str-el↗
arXiv2015

Dual condensates at finite isospin chemical potential

The dual observables as order parameters for center symmetry are tested at finite isospin chemical potential $μ_I$ in a Polyakov-loop enhanced chiral model of QCD with physical quark masses. As a counterpart of the dressed Polyakov-loop, the first Fourier moment of pion condensate is introduced for $μ_I>{m_π}/{2}$ under the temporal twisted boundary conditions for quarks. We demonstrate that this dual condensate exhibits the similar temperature dependence as the conventional Polyakov-loop. We confirm that its rapid increase with $T$ is driven by the evaporating of pion condensation. On the other hand, the dressed Polyakov-loop shows abnormal thermal behavior, which even decreases with $T$ at low temperatures due to the influence of pion condensate. We thus argue that in QCD the critical temperature extracting from a dual observable may have nothing to do with the quark confinement-deconfinement transition if the quark mass is very small.

hep-ph↗
arXiv2014

The Missing Piece in Complex Analytics: Low Latency, Scalable Model Management and Serving with Velox

To support complex data-intensive applications such as personalized recommendations, targeted advertising, and intelligent services, the data management community has focused heavily on the design of systems to support training complex models on large datasets. Unfortunately, the design of these systems largely ignores a critical component of the overall analytics process: the deployment and serving of models at scale. In this work, we present Velox, a new component of the Berkeley Data Analytics Stack. Velox is a data management system for facilitating the next steps in real-world, large-scale analytics pipelines: online model management, maintenance, and serving. Velox provides end-user applications and services with a low-latency, intuitive interface to models, transforming the raw statistical models currently trained using existing offline large-scale compute frameworks into full-blown, end-to-end data products capable of recommending products, targeting advertisements, and personalizing web content. To provide up-to-date results for these complex models, Velox also facilitates lightweight online model maintenance and selection (i.e., dynamic weighting). In this paper, we describe the challenges and architectural considerations required to achieve this functionality, including the abilities to span online and offline systems, to adaptively adjust model materialization strategies, and to exploit inherent statistical properties such as model error tolerance, all while operating at "Big Data" scale.

cs.DB↗
arXiv2013

Fate of separate chiral transitions at finite $μ_I$ under the influence of mismatched vector interactions

The flavor-mixing induced by the mismatched vector-isoscalar and vector-isovector interactions at finite baryon chemical potential $μ$ and isospin chemical potential $μ_I$ is demonstrated in the Nambu-Jona-Lasinio (NJL) type model of QCD. The influence of this non-anomaly flavor-mixing on the possible separate chiral transitions at nonzero $μ_I$ is studied under the assumption of the effective restoration of the $U(1)_A$ symmetry. We find that for the weak isospin asymmetry, the two separate phase boundaries found previously can be converted into one only if the vector-isovector coupling $g_v^v$ is significantly stronger than the vector-isoscalar one $g_v^s$ without the axial anomaly. When the weak Kabayashi-Maskawa-'t Hooft (KMT) interaction is included, we find that the separation of the chiral transition with two critical endpoints for the relatively strong isospin asymmetry can still be removed owning to the vector interactions. In this case, it is not the vector coupling difference but the strength of $g_v^v$ which is crucial for the only phase boundary. We also point out that, in the NJL-type model with mismatched vector interactions, the recently proposed equivalence for chiral transitions at finite $μ$ and $μ_I$ does not hold even at the mean field approximation.

hep-ph↗
arXiv2013

Conditioning the gamma spectrometer for activity measurement at very high background

The application of a high purity germanium (HPGe) gamma spectrometer in determining the fuel element burnup in a future reactor is studied. The HPGe detector is exposed by a Co60 source with varying irradiation rate from 10 kcps to 150 kcps to simulate the input counting rate in real reactor environment. A Cs137 and a Eu152 source are positioned at given distances to generate certain event rate in the detector with the former being proposed as a labeling nuclide to measure the burnup of fuel element. It is shown that both the energy resolution slightly increasing with the irradiation rate and the passthrough rate at high irradiation level match the requirement of the real application. The influence of the background is studied in different parameter sets used in the particularly developed procedure of the background subtraction. It is demonstrated that with the typical input irradiation rate and Cs137 intensity relevant to deep burnup situation, the precision of the Cs137 counting rate in the current experiment is consistently below 2.8%, indicating a promising feasibility of utilizing an HPGe detector in the burnup measurement in future bed-like reactor.

physics.ins-det↗
arXiv2012

Correction to the Chiral Magnetic Effect from axial-vector interaction

The recent lattice calculation at finite axial chemical potential suggests that the induced current density of the chiral magnetic effect (CME) is somehow suppressed comparing with the standard analytical formula. We show in a NJL-type model of QCD that such a suppression is a natural result when considering the influence of the attractive axial-vector interaction. We point out that the lattice result doesn't need to be quantitatively consistent with the analytical formula due to the chirality density-density correlation. We also investigate the nonperturbative effect of instanton molecules on the CME. Since an unconventional repulsive axial-vector interaction is induced, the CME will be enhanced significantly by the instanton-anti-instanton pairings. Such a prediction needs to be tested by more improved lattice simulations. We further demonstrate that the axial-vector interaction plays an important role on the $T-μ_A$ phase diagram.

hep-ph↗
arXiv2012

Many-Task Computing and Blue Waters

This report discusses many-task computing (MTC) generically and in the context of the proposed Blue Waters systems, which is planned to be the largest NSF-funded supercomputer when it begins production use in 2012. The aim of this report is to inform the BW project about MTC, including understanding aspects of MTC applications that can be used to characterize the domain and understanding the implications of these aspects to middleware and policies. Many MTC applications do not neatly fit the stereotypes of high-performance computing (HPC) or high-throughput computing (HTC) applications. Like HTC applications, by definition MTC applications are structured as graphs of discrete tasks, with explicit input and output dependencies forming the graph edges. However, MTC applications have significant features that distinguish them from typical HTC applications. In particular, different engineering constraints for hardware and software must be met in order to support these applications. HTC applications have traditionally run on platforms such as grids and clusters, through either workflow systems or parallel programming systems. MTC applications, in contrast, will often demand a short time to solution, may be communication intensive or data intensive, and may comprise very short tasks. Therefore, hardware and software for MTC must be engineered to support the additional communication and I/O and must minimize task dispatch overheads. The hardware of large-scale HPC systems, with its high degree of parallelism and support for intensive communication, is well suited for MTC applications. However, HPC systems often lack a dynamic resource-provisioning feature, are not ideal for task communication via the file system, and have an I/O system that is not optimized for MTC-style applications. Hence, additional software support is likely to be required to gain full benefit from the HPC hardware.

cs.DC↗
arXiv2011

Axial Anomaly, Mismatched Fermi Surfaces and Vector Interaction in Dense Neutral Quark Matter

We report on effects of the q-$\bar{\rm q}$ vector interaction and/or the U(1)$_A$-anomaly-induced chiral-diquark coupling on the charge-neutral quark matter in $β$-equilibrium. We show that when the vector coupling is absent, there can appear a cross-over region sandwiched by two critical points in the intermediate temperature ($T$) region, while the phase transition in the low-$T$ region including zero temperature keeps being first order until the strength of the anomaly term is increased to have a critical value. On the other hand, when the vector coupling is also present, there appears a crossover region in the low-$T$ area including zero temperature with a new critical point, as was first demonstrated by Kitazawa et al and the present authors without and with the charge-neutral condition, respectively. We remark that the possible chromomagnetic instability is suppressed and can be even completely absent owing to the enhanced diquark coupling due to the anomaly term and/or by the vector interaction.

hep-ph↗
arXiv2011

Graphene morphology regulated by nanowires patterned in parallel on a substrate surface

The graphene morphology regulated by nanowires patterned in parallel on a substrate surface is quantitatively determined using energy minimization. The regulated graphene morphology is shown to be governed by the nanowire diameter, the nanowire spacing and the interfacial bonding energies between the graphene and the underlying nanowires and substrate. We demonstrate two representative regulated graphene morphologies and determine critical values of the nanowire spacing, nanowire diameter and interfacial bonding energies at which graphene switches between the two representative morphologies. Interestingly, we identify a rule-of-thumb formula that correlates the critical nanowire spacing, the critical interfacial bonding energies and the nanowire diameter in quite well agreement with the full-scale simulation results. Results from the present study offer guidelines in nano-structural design to achieve desired graphene morphology via regulation with a resolution approaching the atomic feature size of graphene.

cond-mat.mtrl-sci↗
arXiv2011

Carbon Nanotube Initiated Formation of Carbon Nanoscrolls

The unique topology and exceptional properties of carbon nanoscrolls (CNSs) have inspired unconventional nano-device concepts, yet the fabrication of CNSs remains rather challenging. Using molecular dynamics simulations, we demonstrate the spontaneous formation of a CNS from graphene on a substrate, initiated by a carbon nanotube (CNT). The rolling of graphene into a CNS is modulated by the CNT size, the carbon-carbon interlayer adhesion, and the graphene-substrate interaction. A phase diagram emerging from the simulations can offer quantitative guideline toward a feasible and robust physical approach to fabricating CNSs.

cond-mat.mes-hall↗
arXiv2011

A Molecular Mechanics Study of Morphologic Interaction between Graphene and Si Nanowires on a SiO2 Substrate

In this paper, we study the morphologic interaction between graphene and Si nanowires on a SiO2 substrate, using molecular mechanics simulations. Two cases are considered: 1) a graphene nanoribbon intercalated by a single Si nanowire on a SiO2 substrate and 2) a blanket graphene flake intercalated by an array of Si nanowires evenly patterned in parallel on a SiO2 substrate. Various graphene morphologies emerge from the simulation results of these two cases, which are shown to depend on both geometric parameters (e.g., graphene nanoribbon width, nanowire diameter, and nanowire spacing) and material properties (e.g., graphene-nanowire and graphene-substrate bonding strength). While the quantitative results at the atomistic resolution in this study can be further used to determine the change of electronic properties of graphene under morphologic regulation, the qualitative understandings from this study can be extended to help exploring graphene morphology in other material systems.

cond-mat.mtrl-sci↗