1,720,999 research outputs found
Mirrors and Memory in Quantum Automata
No full textIn this paper we start from the simplest form of Quantum Finite Automata (QFAs), namely Measure-Once QFAs with cut-point. First we elaborate on a variant of their semantics that can be obtained through a shift from the Schrödinger to the Heisenberg picture of Quantum Mechanics. In the Schrödinger picture states evolve in time while observables remain constant, while in the Heisenberg one states are constant and observables evolve. Interestingly, in the case of a QFA such shift reverts time-evolution. However, the equivalence of the two pictures over the class of QFAs holds thanks to the closure of the class with respect to language mirroring. Since the expressive power of such class of automata remains limited to infinite languages, we then consider their extension with bounded (multi-letter QFAs) and unbounded memory. Unfortunately, while bounded memory enhances the expressive power, the unbounded memory approach does not behave as one would expect
Emerging technologies and internationalization: Insights from Italian companies approaching Industry 4.0
No full textIndustry 4.0 technologies are supposed to increase the competitiveness of companies, leading to a new era of “Manufacturing Renaissance”. Nowadays, contemporary dynamics of international competition impose that companies both innovate and internationalize at the same time to remain competitive. In this context, some conceptual studies have speculated on possible consequences of the adoption of technologies related to Industry 4.0 on global value chains. However, empirical studies investigating the role of emerging technologies in international business are still lacking. Through a multiple case study approach, this study presents an exploratory qualitative research investigating the impact of Industry 4.0 technologies on the international strategy of companies. The analysis of 9 Italian manufacturing exporting companies that have adopted these technologies reveals some preliminary findings and opens avenues for future research in international business on these issues
SMEs competing in the international con- text: the influence of Industry 4.0 technologies
No full textAn ASP Approach for the Synthesis of CNOT Minimal Quantum Circuits
Full text linkIn the last year, physical working Quantum Computers have been built and made available for the end users. Such devices, working under the rules of Quantum Mechanics, can only apply a finite set of one/two qubit operations that form a universal set of gates. Single qubit gates are fault-tolerant, while the same cannot be said for two qubit gates. Hence, unitary matrices adopted in Quantum Algorithms must be synthesized in terms of this universal set of operations to obtain a quantum circuit. This synthesis procedure, however, is not constraint-free. In fact, we prefer circuits with minimum number of qubits and with minimum circuit depth. Clifford+T universal set is one of the most adopted in the literature for synthesis. In such set we have 3 single qubit gates and the CNOT, which is a two qubit gate. Many efforts have been directed to devise algorithms that synthesize general unitary matrices into Clifford+T circuits. These algorithms usually tend to optimize circuit depth or eventually the number of T gates. Since two qubit gates are not fault tolerant, in this work we propose an ASP based technique to minimize the number of CNOT gates inside a Clifford+T circuit. We start from a SAT encoding of the problem, and we translate it into an ASP model over a graph, by first working with a generic graph, and then by adopting the structure of a layered DAG. We provide experimental evidence of the scalability of our proposal
Graph-Theoretical Arguments in Support of a Quantum Declarative Manifesto
No full textThe encoding of graphs and the development of efficient algorithms over graphs in the Quantum framework is still a challenging problem. More in general, the understanding of whether a problem can benefit of the Quantum speed-up or not is far from being complete. In this paper we analyse, compare, and generalize some proposals for the encoding of graphs in Quantum computing. A question peeping out on the horizon of our analysis concern the shift from a procedural way of thinking to a declarative one in the context of Quantum computing
Classical computation over quantum architectures from graph encoding to declarative languages compilation
No full textThe lack of purely Quantum Programming Languages constitutes a hurdle in the general description of quantum computational processes; the implementation is heavily dependent on the considered quantum computational model. To bypass the obstacle, this paper pursues a new direction, investigating the compilation of classical programming paradigms over different quantum computational models: Gate-Based, Measurement-Based and Adiabatic Quantum Computation. Since graphs can be exploited to describe both classical and quantum computations, the problem of graph encoding on quantum hardware is tightly connected to our purposes. As such, it holds a major relevance in our quest for quantum compilation. While studying these topics through the lenses of Graph Theory, declarative programming emerges as the ideal candidate for such endeavour. In this paper we consider some existing quantum computational models and for each of them we identify the main subtleties in the compilation of classical languages. In turn, we break these complexities down into easier problems to stimulate further developments in this area of research. As it turns out, the observations for each model differ widely. Nevertheless, as for the tasks here considered, no model seems to claim supremacy over the others. In contrast, declarative programming maintains the spot as the ideal candidate for quantum compilation, independently of the model
Synthesis of CNOT minimal quantum circuits with topological constraints through ASP
Full text linkAlthough with some yet severe limitations, Physical working Quantum Computers are becoming available for end users. Such devices are based on the rules of Quantum Mechanics, which state that physical systems evolve through unitary transformations. However, as in the classical case, in order to have a model of computation, such unitary evolutions are expressed/approximated inside Quantum Computers in terms of a finite set of one/two qubit operations (i.e., through a universal set of gates). Single qubit gates are fault-tolerant, while the same cannot be said for two qubit gates. Hence, unitary matrices adopted in Quantum Algorithms must be synthesized in terms of this universal set of operations to obtain a quantum circuit. In such synthesis procedure we prefer circuits with minimum number of qubits and with minimum circuit depth. Clifford+T universal set is one of the most adopted in the literature for synthesis. In such set we have 3 single qubit gates and the CNOT, which is a two qubit gate. Many efforts have been directed to devise algorithms that synthesize general unitary matrices into Clifford+T circuits. These algorithms usually tend to optimize circuit depth or eventually the number of T gates. Since two qubit gates are not fault tolerant, in this work we propose an ASP based technique to minimize the number of CNOT gates inside a Clifford+T circuit. Moreover, in real world quantum computers, qubit are usually connected to each other according to some particular topology, thus providing further constraints. Two qubit gates —hence, CNOT gate— can be directly applied only to pair of gates that are connected. Such constraint has to be taken into account during the synthesis of CNOT minimal circuits. We propose an ASP model to solve the problem of synthesizing CNOT minimal circuits under topological constraints. We provide experimental evidence of the scalability of our proposal
The creation and development of learning organizations: a review
Full text linkPurpose: In this paper, using the antecedents, decisions and outcomes (ADO) framework, the factors/key performance indicators (KPIs) most relevant for creating or building a learning organization (LO) are identified. This study aims to contribute to the field of knowledge management (KM) in terms of introducing KPIs to foster a business organization with a continuous learning process, mechanisms of knowledge creation and memorization. Design/methodology/approach: In total, 57 papers were selected for this systematic literature review (SLR) from Web of Science and Scopus covering the period 1985–2019. Findings: The 12 most relevant KPIs are identified based on the literature survey conducted in the field of LO. Research limitations/implications: The managerial implications of this review paper will be an added advantage to the modern business organization worldwide that have adopted KM practices to foster knowledge management with information technology (IT) infrastructure. As IT infrastructure focuses on knowledge acquisition, dissemination and storage but the KPIs revealed through this review will help in transforming stored information as learning for the organization to improve its overall performance. Originality/value: This review synthesizes prior studies and provides directions for future research
Early Internationalizing Firms: A Journey Through Decades of Research
No full textThis monograph offers a thorough review of four decades of research on early internationalizing firms, focusing on Born Globals and International New Ventures. It systematically examines 323 empirical studies, exploring the origins, evolution, and key themes within this field. The book covers the theoretical foundations, internationalization strategies, performance outcomes, and the impact of digital technologies on these firms. It also addresses ongoing debates and identifies areas where further research is needed, presenting a clear agenda for future studies. Targeted at scholars, researchers, and advanced students in International Business, Entrepreneurship, and related fields, this monograph is an essential resource for understanding the complexities of early internationalization. It provides valuable insights into the international growth of small and medium-sized enterprises (SMEs) and the factors that influence their success in global markets
- …
