Monolayer Perovskite Bridges Enable Strong Quantum Dot Coupling for Efficient Solar Cells
Not Available
Engineering topics
Publications and source records attributed to Jiang, Zhang.
Not Available
Living tissues are an integrated, multiscale architecture consisting of dense cellular ensembles and extracellular matrices (ECMs). The cells and ECMs cooperate to enable specialized mechanical properties and dynamic responsiveness. However, the mechanical properties of living tissues are difficult to replicate. A particular challenge is identification of a cell-like synthetic component, which is tightly integrated with its matrix and also responsive to external stimuli. Here, we demonstrate that cellular-scale hydrated starch granules, an underexplored component in materials science, can turn conventional hydrogels into tissue-like materials when composites are formed. By using several synchrotron-based X-ray techniques, we reveal the mechanically induced organization and training dynamics of the starch granules in the hydrogel matrix. These dynamic behaviors enable multiple tissue-like properties such as programmability, anisotropy, strain-stiffening, mechanochemistry, and self-healability.
Revealing interfacial structure and dynamics has been one of the essential thematic topics in material science and condensed matter physics. Synchrotron-based x-ray scattering techniques can deliver unique and insightful probing of interfacial structures and dynamics, in particular, in reflection geometries with higher surface and interfacial sensitivity than transmission geometries. We demonstrate the design and implementation of an in situ shearing x-ray measurement system, equipped with both inline parallel-plate and cone-and-plate shearing setups and operated at the advanced photon source at Argonne National Laboratory, to investigate the structures and dynamics of end-tethered polymers at the solid-liquid interface. With a precise lifting motor, a micrometer-scale gap can be produced by aligning two surfaces of a rotating upper shaft and a lower sample substrate. A torsional shear flow forms in the gap and applies tangential shear forces on the sample surface. The technical combination with nanoscale rheology and the utilization of in situ x-ray scattering allow us to gain fundamental insights into the complex dynamics in soft interfaces under shearing. In this work, we demonstrate the technical scope and experimental capability of the in situ shearing x-ray system through the measurements of charged polymers at both flat and curved interfaces upon shearing. Furthermore, through the in situ shearing x-ray scattering experiments integrated with theoretical simulations, we aim to develop a detailed understanding of the short-range molecular structure and mesoscale ionic aggregate morphology, as well as ion transport and dynamics in soft interfaces, thereby providing fundamental insight into a long-standing challenge in ionic polymer brushes with a significant technological impact.
The structure and dynamics of lipid membranes in the presence of extracellular macromolecules are critical for cell membrane functions and many pharmaceutical applications. The pathogen virulence-suppressing end-phosphorylated polyethylene glycol (PEG) triblock copolymer (Pi-ABAPEG) markedly changes the interactions with lipid vesicle membranes and prevents PEG-induced vesicle phase separation in contrast to the unphosphorylated copolymer (ABAPEG). Pi-ABAPEG weakly absorbs on the surface of lipid vesicle membranes and slightly changes the structure of 1,2-dimyristoyl-sn-glycero-3-phosphocholine (DMPC) unilamellar vesicles at 37 °C, as evidenced by small angle neutron scattering. X-ray reflectivity measurements confirm the weak adsorption of Pi-ABAPEG on DMPC monolayer, resulting in a more compact DMPC monolayer structure. Neutron spin-echo results show that the adsorption of Pi-ABAPEG on DMPC vesicle membranes increases the membrane bending modulus $κ$.
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2 53 (about 10 16 ). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. Finally, this dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm.
We investigate directed self-assembly (DSA), with 3x density multiplication, of symmetric polystyrene-block-poly(methyl methacrylate) (L-0 = 28 nm) with increasing film thicknesses and reveal a thickness limit above which the defect annihilation mechanism is different than in thinner films. Block copolymer films of increasing thickness underwent DSA on a macroscopic chemical pattern under optimum geometrical and chemical conditions. Scanning electron microscopy and grazing-incidence small-angle X-ray scattering (GISAXS) were used to characterize the long-range ordering and buried structures as a function of film thickness and thermal annealing time. Rotational GISAXS measurements revealed a critical thickness of similar to 3L(0,) below which defect annihilation is cooperative across the film depth and above which it is faster at the free surface than in the film's interior. In the latter case, defects can persist in the film's interior despite perfect assembly and registration at the free surface of the film.
Commercial applications of quantum computation have become viable due to the rapid progress of the field in the recent years. Efficient quantum algorithms are discovered to cope with the most challenging real-world problems that are too hard for classical computers. Manufactured quantum hardware has reached unprecedented precision and controllability, enabling fault-tolerant quantum computation. Here, I give a brief introduction on what principles in quantum mechanics promise its unparalleled computational power. I will discuss several important quantum algorithms that achieve exponential or polynomial speedup over any classical algorithm. Building a quantum computer is a daunting task, and I will talk about the criteria and various implementations of quantum computers. I conclude the talk with near-future commercial applications of a quantum computer.
Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems. A level-p QAOA circuit consists of steps in which a classical Hamiltonian, derived from the cost function, is applied followed by a mixing Hamiltonian. The 2p times for which these two Hamiltonians are applied are the parameters of the algorithm. As p increases, however, the parameter search space grows quickly. The success of the QAOA approach will depend, in part, on finding effective parameter-setting strategies. Here, we analytically and numerically study parameter setting for QAOA applied to MAXCUT. For level-1 QAOA, we derive an analytical expression for a general graph. In principle, expressions for higher p could be derived, but the number of terms quickly becomes prohibitive. For a special case of MAXCUT, the Ring of Disagrees, or the 1D antiferromagnetic ring, we provide an analysis for arbitrarily high level. Using a Fermionic representation, the evolution of the system under QAOA translates into quantum optimal control of an ensemble of independent spins. This treatment enables us to obtain analytical expressions for the performance of QAOA for any p. It also greatly simplifies numerical search for the optimal values of the parameters. By exploring symmetries, we identify a lower-dimensional sub-manifold of interest; the search effort can be accordingly reduced. This analysis also explains an observed symmetry in the optimal parameter values. Further, we numerically investigate the parameter landscape and show that it is a simple one in the sense of having no local optima.
We designed a quantum search algorithm, giving the same quadratic speedup achieved by Grover's original algorithm; we replace Grover's diffusion operator (hard to implement) with a product diffusion operator generated by transverse fields (easy to implement). In our algorithm, the problem Hamiltonian (oracle) and the transverse fields are applied to the system alternatively. We construct such a sequence that the corresponding unitary generates a closed transition between the initial state (even superposition of all states) and a modified target state, which has a high degree of overlap with the original target state.
Recent numerical result (arXiv:1512.02206) from Google suggested that the D-Wave quantum annealer may have an asymptotic speed-up than simulated annealing, however, the asymptotic advantage disappears when it is compared to quantum Monte Carlo (a classical algorithm despite its name). We show analytically that the asymptotic scaling of quantum tunneling is exactly the same as the escape rate in quantum Monte Carlo for a class of problems. Thus, the Google result might be explained in our framework. We also found that the transition state in quantum Monte Carlo corresponds to the instanton solution in quantum tunneling problems, which is observed in numerical simulations.