22 research outputs found

    PHYS 1033

    Get PDF

    Code-mixing in Chhattisgarhi Conversation of Undergraduate Students

    Get PDF
    This paper investigates code-mixing in Chhattisgarhi based on conversation collected from the undergraduate students in the district of Gourella-Pendra-Marvahi (GPM). In India, lexical items from other languages are often mixed in most of the Indian languages since it is a multilingual country. In fact, this happens in Chhattisgarhi conversation by mixing English words in various situations. English language is used in India as second and foreign language in different places. So, the possibilities of mixing English words in Chhattisgarhi are commonly found in the spoken data. Code-mixing is a phenomenon in the society in which speakers mix words for various reasons. This paper focuses on the nature of code-mixing, the significance of code-mixing, how Chhattisgarhi undergraduate students mix English words, phrases, idioms, baster forms and clauses and the reasons for code-mixing in their Chhattisgarhi conversation. In this study, data was collected from twenty Chhattisgarhi undergraduate students at Pandit Madhav Rao Sapre College in Pendra Road of GPM district. Descriptive qualitative method was used and the informal conversations were collected from undergraduate students in different situations. The data was collected from the students through the audio-recorder in the natural settings. The recorded audio has been transcribed in IPA script, analyzed and discussed in detail in this paper. The participant of one of the researchers also helped to draw on first-hand observation through her membership in the community. The findings reveal that undergraduate students mix considerably English words, phrases, baster forms and clauses in Chhattisgarhi conversation. It is also identified that certain Chhattisgarhi case markers were attached to the English words and the insertion of sounds were found within the words i.e., intra-lexical code-mixing which leads to change the actual pronunciation of the word. The findings disclose the attitudes and opinions of undergraduate students while mixing the English elements and the main reasons for code-mixing in Chhattisgarhi conversation

    Resource theory of quantum uncomplexity

    Get PDF
    Quantum complexity is emerging as a key property of many-body systems, including black holes, topological materials, and early quantum computers. A state's complexity quantifies the number of computational gates required to prepare the state from a simple tensor product. The greater a state's distance from maximal complexity, or “uncomplexity,” the more useful the state is as input to a quantum computation. Separately, resource theories—simple models for agents subject to constraints—are burgeoning in quantum information theory. We unite the two domains, confirming Brown and Susskind's conjecture that a resource theory of uncomplexity can be defined. The allowed operations, fuzzy operations, are slightly random implementations of two-qubit gates chosen by an agent. We formalize two operational tasks, uncomplexity extraction and expenditure. Their optimal efficiencies depend on an entropy that we engineer to reflect complexity. We also present two monotones, uncomplexity measures that decline monotonically under fuzzy operations, in certain regimes. This work unleashes on many-body complexity the resource-theory toolkit from quantum information theory

    Linear growth of quantum circuit complexity

    Get PDF
    The complexity of quantum states has become a key quantity of interest across various subfields of physics, from quantum computing to the theory of black holes. The evolution of generic quantum systems can be modelled by considering a collection of qubits subjected to sequences of random unitary gates. Here we investigate how the complexity of these random quantum circuits increases by considering how to construct a unitary operation from Haar random two qubit quantum gates. Implementing the unitary operation exactly requires a minimal number of gates this is the operation s exact circuit complexity. We prove a conjecture that this complexity grows linearly, before saturating when the number of applied gates reaches a threshold that grows exponentially with the number of qubits. Our proof overcomes difficulties in establishing lower bounds for the exact circuit complexity by combining differential topology and elementary algebraic geometry with an inductive construction of Clifford circuit

    Experimenting with pro-drop in Telugu and Indian English

    Get PDF
    This paper investigates pronominal subjects dropping in Telugu and Indian English and the severity of first language impact on learning and usage of a second language. Numerous languages from various language families are spoken in India. Many of the languages among them are pro-drop languages. Telugu is a full-fledged consistent null subject language with rich verbal agreement. So, pro-drop is common in spoken Telugu. This paper aims at how first language (L1) influences its rules and morpho-syntactic properties on second language (L2) in relation to pro-drop at various levels. To some extent, pro-drop parameter helps us to understand how the language acquisition takes place in children and adults mind/brain in setting the parameter in a specific language. Based on the empirical evidence, several Telugu-speaking children and adults are examined on how they drop pronouns in spoken Telugu and Indian English

    Linear growth of quantum circuit complexity

    Get PDF
    The complexity of quantum states has become a key quantity of interest across various subfields of physics, from quantum computing to the theory of black holes. The evolution of generic quantum systems can be modelled by considering a collection of qubits subjected to sequences of random unitary gates. Here we investigate how the complexity of these random quantum circuits increases by considering how to construct a unitary operation from Haar-random two-qubit quantum gates. Implementing the unitary operation exactly requires a minimal number of gates—this is the operation’s exact circuit complexity. We prove a conjecture that this complexity grows linearly, before saturating when the number of applied gates reaches a threshold that grows exponentially with the number of qubits. Our proof overcomes difficulties in establishing lower bounds for the exact circuit complexity by combining differential topology and elementary algebraic geometry with an inductive construction of Clifford circuits

    Low temperature sintered giant dielectric permittivity CaCu3Ti4O12 sol-gel synthesized nanoparticle capacitors

    No full text
    This paper reports on synthesis of polycrystalline complex perovskite CaCu3Ti4O12 (as CCTO) ceramic powders prepared by a sol–gel auto combustion method at different sintering temperatures and sintering times, respectively. The effect of sintering time on the structure, morphology, dielectric and electrical properties of CCTO ceramics is investigated. Tuning the electrical properties via different sintering times is demonstrated for ceramic samples. X-ray diffraction (XRD) studies confirm perovskite-like structure at room temperature. Abnormal grain growth is observed for ceramic samples. Giant dielectric permittivity was realized for CCTO ceramics. High dielectric permittivity was attributed to the internal barrier layer capacitance (IBLC) model associated with the Maxwell–Wagner (MW) polarization mechanism

    Total Syntheses of the Proposed Structure for Ieodoglucomides A and B

    No full text
    The first enantioselective total synthesis of new glycolipopeptides, ieodoglucomides A and B, has been accomplished along with synthetic elaboration to their C14-epimers starting from d-glucose using β-glycosylation and Grubbs olefin cross-metathesis reactions as the key steps. The present synthetic study has indicated the ambiguity in proposed absolute stereochemistry for the natural product

    Development of Metamaterial Inspired Non-Uniform Circular Array Superstate Antenna Using Characteristic Mode Analysis

    No full text
    In this work, using characteristic mode analysis, a multi-layered nonuniform metasurface structured antenna has been optimized. The driven patch of square structure and the parasitic patch elements of circular radiating cross-slotted meta-structure are used in the proposed model. The modal significance characteristic angles and surface currents are analyzed based on characteristic mode to optimize the nonuniform structures. The antenna is resonating between 5.5–6.1 GHz, covering WLAN applications with an average gain of 7.9 dBi and efficiency greater than 90%. Transient mode, terminal mode, and eigenmode-based analyses are performed on the proposed design, and comparative analysis has been presented in this work. The prototype model fabrication and real-time measurement analysis with simulation results matching are presented for application validation
    corecore