51 research outputs found

    Orbital ordering and enhanced magnetic frustration of strained BiMnO3 thin films

    Full text link
    Epitaxial thin films of multiferroic perovskite BiMnO3 were synthesized on SrTiO3 substrates, and orbital ordering and magnetic properties of the thin films were investigated. The ordering of the Mn^{3+} e_g orbitals at a wave vector (1/4 1/4 1/4) was detected by Mn K-edge resonant x-ray scattering. This peculiar orbital order inherently contains magnetic frustration. While bulk BiMnO3 is known to exhibit simple ferromagnetism, the frustration enhanced by in-plane compressive strains in the films brings about cluster-glass-like properties.Comment: 8 pages, 4 figures, accepted to Europhysics Letter

    The Complexity of Computing Minimal Unidirectional Covering Sets

    Full text link
    Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Brandt and Fischer [BF08] proved that it is NP-hard to decide whether an alternative is contained in some inclusion-minimal upward or downward covering set. For both problems, we raise this lower bound to the Theta_{2}^{p} level of the polynomial hierarchy and provide a Sigma_{2}^{p} upper bound. Relatedly, we show that a variety of other natural problems regarding minimal or minimum-size covering sets are hard or complete for either of NP, coNP, and Theta_{2}^{p}. An important consequence of our results is that neither minimal upward nor minimal downward covering sets (even when guaranteed to exist) can be computed in polynomial time unless P=NP. This sharply contrasts with Brandt and Fischer's result that minimal bidirectional covering sets (i.e., sets that are both minimal upward and minimal downward covering sets) are polynomial-time computable.Comment: 27 pages, 7 figure

    Computational Indistinguishability between Quantum States and Its Cryptographic Application

    Full text link
    We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time quantum adversary. Our problem, QSCDff, is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonly-used distinction problem between two probability distributions in computational cryptography. As our major contribution, we show that QSCDff has three properties of cryptographic interest: (i) QSCDff has a trapdoor; (ii) the average-case hardness of QSCDff coincides with its worst-case hardness; and (iii) QSCDff is computationally at least as hard as the graph automorphism problem in the worst case. These cryptographic properties enable us to construct a quantum public-key cryptosystem, which is likely to withstand any chosen plaintext attack of a polynomial-time quantum adversary. We further discuss a generalization of QSCDff, called QSCDcyc, and introduce a multi-bit encryption scheme that relies on similar cryptographic properties of QSCDcyc.Comment: 24 pages, 2 figures. We improved presentation, and added more detail proofs and follow-up of recent wor

    An open-access database and analysis tool for perovskite solar cells based on the FAIR data principles

    Get PDF
    Large datasets are now ubiquitous as technology enables higher-throughput experiments, but rarely can a research field truly benefit from the research data generated due to inconsistent formatting, undocumented storage or improper dissemination. Here we extract all the meaningful device data from peer-reviewed papers on metal-halide perovskite solar cells published so far and make them available in a database. We collect data from over 42,400 photovoltaic devices with up to 100 parameters per device. We then develop open-source and accessible procedures to analyse the data, providing examples of insights that can be gleaned from the analysis of a large dataset. The database, graphics and analysis tools are made available to the community and will continue to evolve as an open-source initiative. This approach of extensively capturing the progress of an entire field, including sorting, interactive exploration and graphical representation of the data, will be applicable to many fields in materials science, engineering and biosciences

    An open-access database and analysis tool for perovskite solar cells based on the FAIR data principles

    Get PDF
    Large datasets are now ubiquitous as technology enables higher-throughput experiments, but rarely can a research field truly benefit from the research data generated due to inconsistent formatting, undocumented storage or improper dissemination. Here we extract all the meaningful device data from peer-reviewed papers on metal-halide perovskite solar cells published so far and make them available in a database. We collect data from over 42, 400 photovoltaic devices with up to 100 parameters per device. We then develop open-source and accessible procedures to analyse the data, providing examples of insights that can be gleaned from the analysis of a large dataset. The database, graphics and analysis tools are made available to the community and will continue to evolve as an open-source initiative. This approach of extensively capturing the progress of an entire field, including sorting, interactive exploration and graphical representation of the data, will be applicable to many fields in materials science, engineering and biosciences. © 2021, The Author(s)

    Quantum algorithms for algebraic problems

    Full text link
    Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article reviews the current state of quantum algorithms, focusing on algorithms with superpolynomial speedup over classical computation, and in particular, on problems with an algebraic flavor.Comment: 52 pages, 3 figures, to appear in Reviews of Modern Physic

    Consensus statement for stability assessment and reporting for perovskite photovoltaics based on ISOS procedures

    Get PDF
    Funder: 2017 SGR 329 Severo Ochoa program from Spanish MINECO (Grant No. SEV-2017-0706)Funder: This article is based upon work from COST Action StableNextSol MP1307 supported by COST (European Cooperation in Science and Technology). M. V. K., E. A. K., V. B., and A. Osherov thank the financial support of the United States – Israel Binational Science Foundation (grant no. 2015757). E. A. K., A. A., and I. V.-F. acknowledge a partial support from the SNaPSHoTs project in the framework of the German-Israeli bilateral R&D cooperation in the field of applied nanotechnology. M. S. L. thanks the financial support of NSF (ECCS, award #1610833). S. C., M. Manceau and M. Matheron thank the financial support of European Union’s Horizon 2020 research and innovation programme under grant agreement No 763989 (APOLO project). F. De R. and T. M. W. would like to acknowledge the support from the Engineering and Physical Sciences Research Council (EPSRC) through the SPECIFIC Innovation and Knowledge Centre (EP/N020863/1) and express their gratitude to the Welsh Government for their support of the Ser Solar programme. P. A. T. acknowledges financial support from Russian Science Foundation (project No. 19-73-30020). J.K. acknowledges the support by the Solar Photovoltaic Academic Research Consortium II (SPARC II) project, gratefully funded by WEFO. M.K.N. acknowledges financial support from Innosuisse project 25590.1 PFNM-NM, Solaronix, Aubonne, Switzerland. C.-Q. M. would like to acknowledge The Bureau of International Cooperation of Chinese Academy of Sciences for the support of ISOS11 and the Ministry of Science and Technology of China for the financial support (No 2016YFA0200700). N.G.P. acknowledges financial support from the National Research Foundation of Korea (NRF) grants funded by the Ministry of Science, ICT Future Planning (MSIP) of Korea under contracts NRF-2012M3A6A7054861 and NRF-2014M3A6A7060583 (Global Frontier R&D Program on Center for Multiscale Energy System). CSIRO’s contribution to this work was conducted with funding support from the Australian Renewable Energy Agency (ARENA) through its Advancing Renewables Program. A. F. N gratefully acknowledges support from FAPESP (Grant 2017/11986-5) and Shell and the strategic importance of the support given by ANP (Brazil’s National Oil, Natural Gas and Biofuels Agency) through the R&D levy regulation. Y.-L.L. and Q.B. acknowledge support from the National Science Foundation Division of Civil, Mechanical and Manufacturing Innovation under award #1824674. S.D.S. acknowledges the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (HYPERION, grant agreement No. 756962), and the Royal Society and Tata Group (UF150033). The work at the National Renewable Energy Laboratory was supported by the U.S. Department of Energy (DOE) under contract DE-AC36-08GO28308 with Alliance for Sustainable Energy LLC, the manager and operator of the National Renewable Energy Laboratory. The authors (J.J.B, J.M.L., M.O.R, K.Z.) acknowledge support from the De-risking halide perovskite solar cells program of the National Center for Photovoltaics, funded by the U.S. Department of Energy, Office of Energy Efficiency and Renewable Energy, Solar Energy Technology Office. The views expressed in the article do not necessarily represent the views of the DOE or the U.S. Government. The U.S. Government retains and the publisher, by accepting the article for publication, acknowledges that the U.S. Government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this work, or allow others to do so, for U.S. Government purposes. H.J.S. acknowledges the support of EPSRC UK, Engineering and Physical Sciences Research Council. V.T. and M. Madsen acknowledges ‘Villum Foundation’ for funding of the project CompliantPV, under project number 13365. M. Madsen acknowledges Danmarks Frie Forskningsfond, DFF FTP for funding of the project React-PV, No. 8022-00389B. M.G. and S.M.Z. thank the King Abdulaziz City for Science and technology (KACST) for financial support. S.V. acknowledges TKI-UE/Ministry of Economic Affairs for financial support of the TKI-UE toeslag project POP-ART (No. 1621103). M.L.C. and H.X. acknowledges the support from Spanish MINECO for the grant GraPErOs (ENE2016-79282-C5-2-R), the OrgEnergy Excellence Network CTQ2016-81911- REDT, the Agència de Gestiód'Ajuts Universitaris i de Recerca (AGAUR) for the support to the consolidated Catalonia research group 2017 SGR 329 and the Xarxa de Referència en Materials Avançats per a l'Energia (Xarmae). ICN2 is supported by the Severo Ochoa program from Spanish MINECO (Grant No. SEV-2017-0706) and is funded by the CERCA Programme / Generalitat de Catalunya.Abstract: Improving the long-term stability of perovskite solar cells is critical to the deployment of this technology. Despite the great emphasis laid on stability-related investigations, publications lack consistency in experimental procedures and parameters reported. It is therefore challenging to reproduce and compare results and thereby develop a deep understanding of degradation mechanisms. Here, we report a consensus between researchers in the field on procedures for testing perovskite solar cell stability, which are based on the International Summit on Organic Photovoltaic Stability (ISOS) protocols. We propose additional procedures to account for properties specific to PSCs such as ion redistribution under electric fields, reversible degradation and to distinguish ambient-induced degradation from other stress factors. These protocols are not intended as a replacement of the existing qualification standards, but rather they aim to unify the stability assessment and to understand failure modes. Finally, we identify key procedural information which we suggest reporting in publications to improve reproducibility and enable large data set analysis

    An open-access database and analysis tool for perovskite solar cells based on the FAIR data principles

    Get PDF
    AbstractLarge datasets are now ubiquitous as technology enables higher-throughput experiments, but rarely can a research field truly benefit from the research data generated due to inconsistent formatting, undocumented storage or improper dissemination. Here we extract all the meaningful device data from peer-reviewed papers on metal-halide perovskite solar cells published so far and make them available in a database. We collect data from over 42,400 photovoltaic devices with up to 100 parameters per device. We then develop open-source and accessible procedures to analyse the data, providing examples of insights that can be gleaned from the analysis of a large dataset. The database, graphics and analysis tools are made available to the community and will continue to evolve as an open-source initiative. This approach of extensively capturing the progress of an entire field, including sorting, interactive exploration and graphical representation of the data, will be applicable to many fields in materials science, engineering and biosciences.</jats:p
    corecore