Zaloguj się

Gotowe bibliografie tematyczne / Mermin polynomials

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Części książek
Streszczenia konferencji

Gotowa bibliografia na temat „Mermin polynomials”

Autor: Grafiati

Data publikacji: 1 lutego 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Mermin polynomials”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Mermin polynomials"

1

Garg, Anupam. "The discrete Chebyshev–Meckler–Mermin–Schwarz polynomials and spin algebra." Journal of Mathematical Physics 63, no. 7 (2022): 072101. http://dx.doi.org/10.1063/5.0094575.

Pełny tekst źródła

Streszczenie:

The polynomials discovered by Chebyshev and subsequently related to spin transition probabilities by Meckler [Meckler, Phys. Rev. 111, 1447 (1958)] and Mermin and Schwarz [Found. Phys. 12, 101 (1982)] are studied, and their application to phase space representations of spin states and operators is examined. In particular, a formula relating the end-point value of the polynomials to scale factors relating different phase space representations of spherical harmonic operators is found. This formula is applied to illustrative calculations of Wigner functions for a single spin and the singlet state

Style APA, Harvard, Vancouver, ISO itp.

2

Delavenne, Hugo, François Le Gall, Yupan Liu, and Masayuki Miyamoto. "Quantum Merlin-Arthur proof systems for synthesizing quantum states." Quantum 9 (April 3, 2025): 1688. https://doi.org/10.22331/q-2025-04-03-1688.

Pełny tekst źródła

Streszczenie:

Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it is natural to apply a different notion of complexity, namely the complexity of synthesizing quantum states. We investigate a state-synthesizing counterpart of the class NP, referred to as stateQMA, which is concerned with preparing certain quantum states through a polynomial-time quantum verifier with the aid of a single quantum message from an all-powerful but untrusted prover. This is a subclass of the class stateQI

Style APA, Harvard, Vancouver, ISO itp.

3

Morimae, Tomoyuki, Yuki Takeuchi, and Harumichi Nishimura. "Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy." Quantum 2 (November 15, 2018): 106. http://dx.doi.org/10.22331/q-2018-11-15-106.

Pełny tekst źródła

Streszczenie:

We introduce a simple sub-universal quantum computing model, which we call the Hadamard-classical circuit with one-qubit (HC1Q) model. It consists of a classical reversible circuit sandwiched by two layers of Hadamard gates, and therefore it is in the second level of the Fourier hierarchy. We show that output probability distributions of the HC1Q model cannot be classically efficiently sampled within a multiplicative error unless the polynomial-time hierarchy collapses to the second level. The proof technique is different from those used for previous sub-universal models, such as IQP, Boson Sa

Style APA, Harvard, Vancouver, ISO itp.

4

CAI, JIN-YI, DENIS CHARLES, A. PAVAN, and SAMIK SENGUPTA. "ON HIGHER ARTHUR-MERLIN CLASSES." International Journal of Foundations of Computer Science 15, no. 01 (2004): 3–19. http://dx.doi.org/10.1142/s0129054104002273.

Pełny tekst źródła

Streszczenie:

We study higher Arthur-Merlin classes defined via several natural probabilistic operators BP, R and coR. We investigate the complexity classes they define, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bounds to the intersection of the complementary classes in the hierarchy.

Style APA, Harvard, Vancouver, ISO itp.

5

Aharonov, Dorit, Michael Ben-Or, Fernando G. S. L. Brandão, and Or Sattath. "The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings." Quantum 6 (March 17, 2022): 668. http://dx.doi.org/10.22331/q-2022-03-17-668.

Pełny tekst źródła

Streszczenie:

Valiant-Vazirani showed in 1985 \cite{VV85} that solving NP with the promise that "yes" instances have only one witness is powerful enough to solve the entire NP class (under randomized reductions).We are interested in extending this result to the quantum setting. We prove extensions to the classes Merlin-Arthur MA and Quantum-Classical-Merlin-Arthur QCMA \cite{AN02}. Our results have implications for the complexity of approximating the ground state energy of a quantum local Hamiltonian with a unique ground state and an inverse polynomial spectral gap. We show that the estimation (to within po

Style APA, Harvard, Vancouver, ISO itp.

6

Gharibian, Sevag, Jamie Sikora, and Sarvagya Upadhyay. "QMA variants with polynomially many provers." Quantum Information and Computation 13, no. 1&2 (2013): 135–57. http://dx.doi.org/10.26421/qic13.1-2-8.

Pełny tekst źródła

Streszczenie:

We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each of logarithmic-size, is exactly \class{MQA} (also known as QCMA), the class of problems which can be efficiently verified via a classical proof and a quantum verifier. We then study the class $\class{BellQMA}(\poly)$, characterized by a verifier who first applies unentangled, nonadaptive measurements to each of the polynomially many proofs, followed by an arbitrary but efficient quantum verification c

Style APA, Harvard, Vancouver, ISO itp.

7

de Boutray, Henri, Hamza Jaffali, Frédéric Holweck, Alain Giorgetti, and Pierre-Alain Masson. "Mermin polynomials for non-locality and entanglement detection in Grover’s algorithm and Quantum Fourier Transform." Quantum Information Processing 20, no. 3 (2021). http://dx.doi.org/10.1007/s11128-020-02976-z.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Kuno, Yoshihito. "Study of quantum nonlocality by CHSH function and its extension in disordered fermions." Journal of Physics: Condensed Matter, September 18, 2024. http://dx.doi.org/10.1088/1361-648x/ad7cb4.

Pełny tekst źródła

Streszczenie:

Abstract Quantum nonlocality is an important concept in quantum physics. In this work, we study the quantum nonlocality in a fermion many-body system under quasi-periodic disorders. The Clauser-Horne-Shimony-Holt (CHSH) inequality is systematically investigated, which quantifies quantum nonlocality between two sites. We find particular behaviors of the quantifiers of quantum nonlocality around the extended and critical phase transitions in the system and further that the CHSH inequality is not broken in the globally averaged picture of the maximum value of the quantum nonlocality, but the viol

Style APA, Harvard, Vancouver, ISO itp.

9

Rethinasamy, Soorya, Margarite LaBorde, and Mark Wilde. "Quantum Computational Complexity and Symmetry." Canadian Journal of Physics, October 15, 2024. http://dx.doi.org/10.1139/cjp-2023-0260.

Pełny tekst źródła

Streszczenie:

Testing the symmetries of quantum states and channels provides a way to assess their usefulness for different physical, computational, and communication tasks. Here, we establish several complexity-theoretic results that classify the difficulty of symmetry-testing problems involving a unitary representation of a group and a state or a channel that is being tested. In particular, we prove that various such symmetry-testing problems are complete for BQP (bounded-error quantum polynomial time), QMA (quantum Merlin-Arthur), QSZK (quantum statistical zero-knowledge), QIP(2) (two-message quantum int

Style APA, Harvard, Vancouver, ISO itp.

10

Coblentz, Wayne K., and Michael J. Ottman. "Effects of harvest date and growth stage on triticale forages in the southwest USA: kinetics of in vitro disappearance of fiber and dry matter." Journal of Animal Science 100, no. 3 (2022). http://dx.doi.org/10.1093/jas/skac020.

Pełny tekst źródła

Streszczenie:

Abstract Recently, there has been interest in including triticale (X Triticosecale Wittmack) within forage programs in the southwest USA. Our objectives were to evaluate in vitro disappearance kinetics of neutral detergent fiber (NDF) and dry matter (DM) for cultivars identified during 2019 as positively or negatively deviant from typical cultivars, based specifically on regressions of 48-h in vitro disappearance of NDF on growth stage (GRST). All NDF analyses included the use of heat-stable α-amylase and sodium sulfite, as well as correction for residual ash (asNDFom). Seven triticale cultiva

Style APA, Harvard, Vancouver, ISO itp.

Rozprawy doktorskie na temat "Mermin polynomials"

1

Amouzou, Grâce Dorcas Akpéné. "Etude de l’intrication par les polynômes de Mermin : application aux algorithmes quantiques." Electronic Thesis or Diss., Bourgogne Franche-Comté, 2024. http://www.theses.fr/2024UBFCK063.

Pełny tekst źródła

Streszczenie:

Cette thèse explore la mesure de l'intrication dans certains états hypergraphiques, dans certains algorithmes quantiques tels que les algorithmes quantiques d'estimation de phase et de comptage, ainsi que dans les circuits d'agents réactifs, à l'aide de la mesure géométrique de l'intrication, d'outils issus des polynômes de Mermin et des matrices de coefficients. L'intrication est un concept présent en physique quantique qui n'a pas d'équivalent connu à ce jour en physique classique.Le coeur de notre recherche repose sur la mise en place de dispositifs de détection et de mesure de l'intricatio

Style APA, Harvard, Vancouver, ISO itp.

2

Blier, Hugue. "Preuves interactives classiques." Thèse, 2006. http://hdl.handle.net/1866/16728.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Mbakop, Guy Merlin [Verfasser]. "Effiziente Lösung reeller polynomialer Gleichungssysteme / Mbakop Guy Merlin." 1999. http://d-nb.info/958731624/34.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Mermin polynomials"

1

Ma, Jianbing, Weiru Liu, and Anthony Hunter. "The Non-archimedean Polynomials and Merging of Stratified Knowledge Bases." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02906-6_36.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Valk, Jeroen, Mathijs de Weerdt, and Cees Witteveen. "Coordination in Multi-Agent Planning with an Application in Logistics." In Intelligent Techniques for Planning. IGI Global, 2005. http://dx.doi.org/10.4018/978-1-59140-450-7.ch006.

Pełny tekst źródła

Streszczenie:

Multi-agent planning comprises planning in an environment with multiple autonomous actors. Techniques for multi-agent planning differ from conventional planning in that planning activities are distributed and the planning autonomy of the agents must be respected. We focus on approaches to coordinate the multi-agent planning process. While usually coordination is intertwined with the planning process, we distinguish a number of separate phases in the planning process to get a clear view on the different role(s) of coordination. In particular, we discuss the pre-planning coordination phase and p

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Mermin polynomials"

1

Shoup, Terry E. "An Improved Method for Predicting Minor-Axis Shear Stresses in Rectangular Shafts Under Torsion Using Optimization Polynomials." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-86526.

Pełny tekst źródła

Streszczenie:

This paper presents four new approximation formulas for predicting the shear stress in rectangular members subjected to torque loading. The results are developed using a hybrid optimization method applied to a polynomial merit function to predict the maximum shear stress along the center of the shorter side of a rectangular cross section subjected to a torque. The results of this optimization process are shown to be highly accurate and easy to apply. It is believed that this is the first time that this approach has been applied to find this component of the shear stress. This paper includes an

Style APA, Harvard, Vancouver, ISO itp.

2

Mathew, Reji, and David S. Taubman. "Hierarchical and Polynomial Motion Modeling with Quad-Tree Leaf Merging." In 2006 International Conference on Image Processing. IEEE, 2006. http://dx.doi.org/10.1109/icip.2006.313103.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Wang, Yongtian, Xingui Tang, and Lin Li. "Aberration polynomial fitting and MTF based optimization for general optical systems." In International Optical Design Conference. Optica Publishing Group, 1998. http://dx.doi.org/10.1364/iodc.1998.lmc.4.

Pełny tekst źródła

Streszczenie:

Although there are different ways to implement MTF optimization1,2 in an optical design program, a common requirement of them is to express the wave-aberration as a polynomial in the exit pupil coordinates. While in-depth studies have been carried out for polynomial fitting for rotationally symmetric optical systems3,4, few publications can be found on the subject for general systems without symmetry. A simple scheme is developed for the efficient and accurate determination of the coefficients of a Zernike wave-aberration polynomial for a given object point and a general optical system. It ena

Style APA, Harvard, Vancouver, ISO itp.

4

Pauca, Ovidiu, Anca Maxim, and Constantin F. Caruntu. "Trajectory Planner based on Third-order Polynomials applied for Platoon Merging and Splitting." In 2021 29th Mediterranean Conference on Control and Automation (MED). IEEE, 2021. http://dx.doi.org/10.1109/med51440.2021.9480261.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Shoup, T. E., and L. A. Sanchez. "An Improved Method for Predicting Shear Stress in Rectangular Shafts Based on Optimization Polynomials." In ASME 1995 15th International Computers in Engineering Conference and the ASME 1995 9th Annual Engineering Database Symposium collocated with the ASME 1995 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/cie1995-0777.

Pełny tekst źródła

Streszczenie:

Abstract This paper presents several new approximations for the coefficients associated with the shear stresses in rectangular shafts. The new results are developed using an optimization approach based on a polynomial merit function to predict the maximum shear stress along the center of the long side of the cross section. The results are shown to be more accurate than existing approximate methods that are now in the literature.

Style APA, Harvard, Vancouver, ISO itp.

6

Benferhat, Salem, Zied Bouraoui, Ma Thi Chau, Sylvain Lagrue, and Julien Rossit. "A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption." In 9th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2017. http://dx.doi.org/10.5220/0006120804150422.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Gorguluarslan, Recep M., and Seung-Kyum Choi. "An Improved Stochastic Upscaling Method for Multiscale Engineering Systems." In ASME 2014 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/detc2014-34418.

Pełny tekst źródła

Streszczenie:

A stochastic multiscale modeling technique is proposed to construct coarse scale representation of a fine scale model for use in engineering design problems. The complexity of the fine scale heterogeneity under uncertainty is replaced with the homogenized coarse scale parameters by seeking agreement between the responses at both scales. Generalized polynomial chaos expansion is implemented to reduce the dimensionality of propagating uncertainty through scales and the computational costs of the upscaling method. It is integrated into a hybrid optimization procedure with the genetic algorithm an

Style APA, Harvard, Vancouver, ISO itp.

8

Bernstein, N. S., and K. Preiss. "Representation of Tolerance Information in Solid Models." In ASME 1989 Design Technical Conferences. American Society of Mechanical Engineers, 1989. http://dx.doi.org/10.1115/detc1989-0018.

Pełny tekst źródła

Streszczenie:

Abstract A set of tolerance constraints in solid models is represented as a constraint network over the degrees of freedom of the shape elements of the body. This approach is referred to as the constraint propagation approach to the representation of tolerance information. An evaluation of the resultant constraint network provides both an analysis of a specific dimension and tolerance scheme and figures of merit regarding the combinatorial and geometric/numeric computational complexity of a set of engineering spatial constraints. This paper discusses the representation needed to achieve that e

Style APA, Harvard, Vancouver, ISO itp.

9

Peng, C., Y. Yan, X. Y. Wang, and Y. Z. Huo. "Analysis of Microstructure Evolution During Tensile Stress Induced Martensitic Transformations." In ASME 2008 Conference on Smart Materials, Adaptive Structures and Intelligent Systems. ASMEDC, 2008. http://dx.doi.org/10.1115/smasis2008-358.

Pełny tekst źródła

Streszczenie:

An image analysis technique was employed to document the layered parallel microstructures observed during tensile tests of CuAlNi single crystal shape memory alloys. The evolution of the microstructures during the stress induced martensitic transformation can be then well studied quantitatively by the evolution of the phase character function and its suitable averages. The results indicated clearly that the stress induced martensite transformation should consist three periods, initial formation, mixed formation and growth, merging due to growth. Euler-Lagrange equations for the minimizers of s

Style APA, Harvard, Vancouver, ISO itp.

10

Vafaeesefat, Abbas, and Hoda A. ElMaraghy. "Data Reduction for Reverse Engineering of Free Form Surfaces." In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/cie-9132.

Pełny tekst źródła

Streszczenie:

Abstract The large amount of irregular and unstructured data collected by the laser scanner, often refered to as “cloud data”, presents a serious challenge in reverse engineering applications. Data reduction is essential for simplifying the process of creating surface models in order to remove redundancy, save space, and speed up the display and recognition tasks. In this paper, an algorithm which effectively reduces the data collected by laser scanners is presented. Data points are first organized into a large regular grid of data points which is then interpolated using the linear polynominal

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!