Search references for QUANTUM PHASE-ESTIMATION-ALGORITHM. Phrases containing QUANTUM PHASE-ESTIMATION-ALGORITHM
See searches and references containing QUANTUM PHASE-ESTIMATION-ALGORITHM!QUANTUM PHASE-ESTIMATION-ALGORITHM
Quantum algorithm for eigenvalue estimation
In quantum computing, the quantum phase estimation algorithm is a quantum algorithm to estimate the phase corresponding to an eigenvalue of a given unitary
Quantum phase estimation algorithm
Quantum_phase_estimation_algorithm
Algorithm to be run on quantum computers
factoring. The quantum phase estimation algorithm is used to determine the eigenphase of an eigenvector of a unitary gate, given a quantum state proportional
Quantum_algorithm
Quantum algorithm for counting solutions to search problems
the quantum phase estimation algorithm and on Grover's search algorithm. Counting problems are common in diverse fields such as statistical estimation, statistical
Quantum_counting_algorithm
Quantum algorithm for integer factorization
Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor
Shor's_algorithm
Change of basis applied in quantum computing
quantum phase estimation algorithm for estimating the eigenvalues of a unitary operator, and algorithms for the hidden subgroup problem. The quantum Fourier
Quantum_Fourier_transform
Quantum algorithm
In quantum computing, the variational quantum eigensolver (VQE) is a quantum algorithm for quantum chemistry, quantum simulations and optimization problems
Variational quantum eigensolver
Variational_quantum_eigensolver
Quantum algorithm for solving systems of linear equations
|b\rangle } for a superposition of different times t. The algorithm then uses quantum phase estimation to decompose | b ⟩ {\displaystyle |b\rangle } in the
HHL_algorithm
several quantum algorithms Quantum optimization algorithms: family of quantum algorithms for optimization problems Quantum phase estimation algorithm: estimates
List_of_algorithms
Quantum computing technique
technique in quantum computing that generalizes the idea behind Grover's search algorithm, and gives rise to a family of quantum algorithms. It was discovered
Amplitude_amplification
Problem in quantum information science
In the quantum walk, a unitary operation whose spectrum is related to the Hamiltonian is implemented then the Quantum phase estimation algorithm is used
Hamiltonian_simulation
Computer simulation of chemical systems
classical algorithms. For instance, it has implications for the Quantum Phase Estimation algorithm, which is fundamental in various quantum computing
Quantum computational chemistry
Quantum_computational_chemistry
Interdisciplinary research area
Quantum machine learning (QML) is the study of quantum algorithms for machine learning. It often refers to quantum algorithms for machine learning tasks
Quantum_machine_learning
List of quantum computing algorithms
the quantum Fourier transform, amplitude amplification, quantum walks, phase estimation, or hybrid quantum-classical optimization. Adiabatic quantum computation
List_of_quantum_algorithms
Cryptography secured against quantum computers
cryptographic algorithms (usually public-key algorithms) that are currently thought, but not proven, to be secure against a cryptanalytic attack by a quantum computer
Post-quantum_cryptography
Deterministic quantum algorithm
The Deutsch–Jozsa algorithm is a deterministic quantum algorithm proposed by David Deutsch and Richard Jozsa in 1992 with improvements by Richard Cleve
Deutsch–Jozsa_algorithm
Quantum algorithm
Grover's algorithm Quantum phase estimation Quantum walk Random walk Portugal, Renato, ed. (2013). Quantum walks and search algorithms. Quantum science
Quantum_walk_search
Optimization algorithms using quantum computing
Quantum optimization algorithms are quantum algorithms that are used to solve optimization problems. Mathematical optimization deals with finding the best
Quantum optimization algorithms
Quantum_optimization_algorithms
Quantum Mechanics in Neural Networks
model of quantum computation has recently been proposed by Schuld, Sinayskiy and Petruccione based on the quantum phase estimation algorithm. At a larger
Quantum_neural_network
Algorithmic Qubits (AQ) are an application based benchmark of quantum computers. Introduced by IonQ in 2020, the goal was to define a "single number figure
Algorithmic_qubits
Computer hardware technology that uses quantum mechanics
result. The design of quantum algorithms involves creating procedures that allow a quantum computer to perform this amplification. Quantum computers are not
Quantum_computing
Quantum algorithm
The Bernstein–Vazirani algorithm, which solves the Bernstein–Vazirani problem, is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in
Bernstein–Vazirani_algorithm
Russian-American physicist (born 1963)
questions in computational complexity. He introduced the quantum phase estimation algorithm, a general procedure for estimating eigenphases of unitary
Alexei_Kitaev
Basic circuit in quantum computing
intent in a quantum search algorithm. This effect of value-sharing via entanglement is used in Shor's algorithm, phase estimation and in quantum counting
Quantum_logic_gate
Computational benchmark
that can be solved by that quantum computer and has a superpolynomial speedup over the best known or possible classical algorithm for that task. Examples
Quantum_supremacy
Mechanism in quantum computing
quantum algorithms such as Shor's algorithm, where quantum phase estimation is used to factor large integers efficiently. The Deutsch–Jozsa algorithm, and
Phase_kickback
Information held in the state of a quantum system
the advent of quantum computing, which uses quantum mechanics to design algorithms. At this point, quantum computers showed promise of being much faster
Quantum_information
Quantum computing implementation
properties of other quantum systems. In the 1990s, two quantum algorithms were published, which further stirred interest in realizing quantum computers. Peter
Superconducting quantum computing
Superconducting_quantum_computing
Quantum physics-based metaheuristic for optimization problems
term "quantum annealing" was first proposed in 1988 by B. Apolloni, N. Cesa Bianchi and D. De Falco as a quantum-inspired classical algorithm. It was
Quantum_annealing
Secure communication method
symmetric key algorithms like the Advanced Encryption Standard algorithm. Quantum communication involves encoding information in quantum states, or qubits
Quantum_key_distribution
Cloud quantum computing platform
to run algorithms and experiments, and explore tutorials and simulations around what might be possible with quantum computing. IBM's quantum processors
IBM_Quantum_Platform
Reconstruction of quantum states based on measurements
Quantum tomography or quantum state tomography is the process by which a quantum state is reconstructed using measurements on an ensemble of identical
Quantum_tomography
the deterministic Deutsch–Jozsa algorithm on a quantum computer, but for which no deterministic classical algorithm is possible. This was perhaps the
Timeline of quantum computing and communication
Timeline_of_quantum_computing_and_communication
Computer programming for quantum computers
Quantum programming refers to the process of designing and implementing algorithms that operate on quantum systems, typically using quantum circuits composed
Quantum_programming
Russian university
physicist, best known for introducing the quantum phase estimation algorithm and the concept of the topological quantum computer Sergey Korolev – Soviet rocket
Moscow Institute of Physics and Technology
Moscow_Institute_of_Physics_and_Technology
Model of quantum computation
captures all of the power of quantum computation—that is, any quantum algorithm can be expressed formally as a particular quantum Turing machine. However,
Quantum_Turing_machine
Process in quantum computing
Quantum error correction (QEC) comprises a set of techniques used in quantum memory and quantum computing to protect quantum information from errors arising
Quantum_error_correction
Quantum-mechanical version of computer memory
the states stored in quantum memory can be in a quantum superposition, giving much more practical flexibility in quantum algorithms than classical information
Quantum_memory
Quantum search algorithm
In quantum computing, Grover's algorithm, also known as the quantum search algorithm, is a quantum algorithm for unstructured search that finds with high
Grover's_algorithm
Networks connecting quantum processors
Quantum networks form an important element of quantum computing and quantum communication systems. Quantum networks facilitate the transmission of information
Quantum_network
Physical phenomenon
Quantum teleportation is a technique for transferring quantum information from a sender at one location to a receiver some distance away. While teleportation
Quantum_teleportation
Experimental technology level
two quantum processors have over 1,000 qubits, with sub-1,000 quantum processors still remaining the norm. NISQ algorithms are quantum algorithms designed
Noisy intermediate-scale quantum computing
Noisy_intermediate-scale_quantum_computing
Computational complexity class of problems
is the quantum analogue to the complexity class BPP. A decision problem is a member of BQP if there exists a quantum algorithm (an algorithm that runs
BQP
Computational complexity of quantum algorithms
simulate quantum computation models in polynomial time. Asymptotic computational complexities of both quantum algorithms and classical algorithms are often
Quantum_complexity_theory
Very general problem in computer science
important in the theory of quantum computing because Shor's algorithms for factoring and finding discrete logarithms in quantum computing are instances of
Hidden_subgroup_problem
Continuous (non-quantized) quantities in quantum information science
S2CID 1855075. Bessen, Arvid J. (2005-04-08). "Lower bound for quantum phase estimation". Physical Review A. 71 (4) 042313. arXiv:quant-ph/0412008. Bibcode:2005PhRvA
Continuous-variable quantum information
Continuous-variable_quantum_information
Sorting algorithms for quantum computers
A quantum sort is any sorting algorithm that runs on a quantum computer. Any comparison-based quantum sorting algorithm would take at least Ω ( n log
Quantum_sort
decision problem is a member of BQP if there exists a quantum algorithm (an algorithm that runs on a quantum computer) that solves the decision problem with
Glossary_of_quantum_computing
Type of quantum computer built out of Rydberg atoms
neutral atom quantum computer is a type of quantum computer built using Rydberg atoms; this type has many commonalities with trapped-ion quantum computers
Neutral_atom_quantum_computer
Quantum computing applied to natural language processing
structure to quantum processes. The first quantum algorithm for natural language processing used the DisCoCat framework and Grover's algorithm to show a
Quantum natural language processing
Quantum_natural_language_processing
Type of quantum computer
Nonetheless, certain algorithms may be a more natural fit to the topological quantum computer model. For example, algorithms for evaluating the Jones
Topological_quantum_computer
Proposed quantum computer implementation
A trapped-ion quantum computer (TIQC) is one proposed approach to a large-scale quantum computer. Ions, or charged atomic particles, can be confined and
Trapped-ion_quantum_computer
Basic unit of quantum information
In quantum computing, a qubit (/ˈkjuːbɪt/) or quantum bit is a basic unit of quantum information, the quantum version of the classic binary bit. A qubit
Qubit
Problem in computer science
computer. The quantum algorithm solving Simon's problem, usually called Simon's algorithm, served as the inspiration for Shor's algorithm. Both problems
Simon's_problem
Model-free reinforcement learning algorithm
Proximal policy optimization (PPO) is a reinforcement learning (RL) algorithm for training an intelligent agent. Specifically, it is a policy gradient
Proximal_policy_optimization
Interdisciplinary theory behind quantum computing
frameworks, designing quantum algorithms, constructing quantum hardware, and implementing quantum communication protocols. Quantum teleportation, entanglement
Quantum_information_science
Concept in quantum information theory
In quantum information theory, quantum state purification refers to the process of representing a mixed state as a pure quantum state of higher-dimensional
Quantum_state_purification
Model of quantum computing
In quantum information theory, a quantum circuit is a model for quantum computation, similar to classical circuits, in which a computation is a sequence
Quantum_circuit
Quantum computing protocol
ground states of quantum many-body systems and classify quantum phases of matter. Algorithm Shadow generation Inputs N {\displaystyle N} copies of an
Classical_shadow
Discrete Fourier transform algorithm
certain Markov processes, robotics etc. Quantum FFTs Shor's fast algorithm for integer factorization on a quantum computer has a subroutine to compute DFT
Fast_Fourier_transform
Description of a quantum-mechanical system
function of a non-relativistic quantum-mechanical system. Its discovery was a significant landmark in the development of quantum mechanics. It is named after
Schrödinger_equation
Cryptography based on quantum mechanical phenomena
Quantum cryptography is the science of exploiting quantum mechanical properties such as quantum entanglement, measurement disturbance, no-cloning theorem
Quantum_cryptography
Metric for a quantum computer's capabilities
reliable Quantum Operations per Second (rQOPS) proposed by Microsoft, Circuit Layer Operations Per Second (CLOPS) proposed by IBM and Algorithmic qubits
Quantum_volume
Remote quantum processors for computation
execute quantum algorithms without the need for direct interaction with specialized hardware, facilitating broader participation in quantum software
Cloud-based_quantum_computing
Mathematical model of ferromagnetism in statistical mechanics
Metropolis–Hastings algorithm is the most commonly used Monte Carlo algorithm to calculate Ising model estimations. The algorithm first chooses selection
Ising_model
Quantum computing algorithm
universal for quantum computation, magic states combined with Clifford gates are also universal. The first magic state distillation algorithm, invented by
Magic_state_distillation
Restricted model of non-universal quantum computation
with n photons and m output modes. This algorithm leads to an estimate of 50 photons required to demonstrate quantum supremacy with boson sampling. There
Boson_sampling
Simulators of quantum mechanical systems
Quantum simulators permit the study of a quantum system in a programmable fashion. In this instance, simulators are special purpose devices designed to
Quantum_simulator
Overview of and topical guide to machine learning
density estimation Variable rules analysis Variational message passing Varimax rotation Vector quantization Vicarious (company) Viterbi algorithm Vowpal
Outline_of_machine_learning
Computing company founded in 2014
composed. Quantinuum's full Quantum Monte Carlo Integration engine is designed to use quantum algorithms to perform estimations more efficiently and accurately
Quantinuum
Concept in computer science
to f failures, provided n > 4f. In the phase king algorithm, there are f + 1 phases, with 2 rounds per phase. Each process keeps track of its preferred
Consensus_(computer_science)
Involutive change of basis in linear algebra
Prakash Vedula (2024). "An efficient quantum algorithm for preparation of uniform quantum superposition states". Quantum Information Processing. 23:38 (1):
Hadamard_transform
Method of quantum computing
resource. Quantum gate teleportation Continuous-variable quantum information Quantum algorithm Quantum logic gate Linear optical quantum computing Quantum optics
One-way_quantum_computer
Computer scientist
implementation using relative-phase Toffoli gates Estimation and benchmarking of quantum advantage - Led development of quantum-vs-classical benchmarking
Dmitri_Maslov
Search problem in quantum mechanics
and a binary vector. 2D HLF can be solved exactly by a constant-depth quantum circuit restricted to a 2-dimensional grid of qubits using bounded fan-in
Hidden linear function problem
Hidden_linear_function_problem
Italian quantum physicist (born 1955)
optimal phase-estimation for mixed states, and the optimal protocols for phase cloning. D'Ariano and collaborators introduced the concept of "quantum comb"
Giacomo_Mauro_D'Ariano
Type of quantum information processing
Adiabatic quantum computation (AQC) is a form of quantum computing which relies on the adiabatic theorem to perform calculations and is closely related
Adiabatic_quantum_computation
Planned quantum technology campus in Chicago
The Illinois Quantum and Microelectronics Park (IQMP) is a planned 128-acre technology campus on the site of the former U.S. Steel South Works on the
Illinois Quantum and Microelectronics Park
Illinois_Quantum_and_Microelectronics_Park
Topological quantum error correcting code
The surface code is a topological quantum error correcting code, and an example of a stabilizer code, defined on a two-dimensional spin lattice. The first
Surface_code
Projected date when quantum computers could break modern encryption
in a human lifetime, not in many of them. Shor's algorithm, on a large enough fault-tolerant quantum computer, would do both in polynomial time and leave
Quantum_Threat
Property of computational resources needed
In quantum information theory, magic is a property that quantifies the computational resources needed to describe quantum states beyond stabilizer states
Magic_(quantum_information)
Quantum algorithm
In quantum computing, the Brassard–Høyer–Tapp (BHT) algorithm is a quantum algorithm that solves the collision problem. In this problem, one is given
BHT_algorithm
Structure that repeats in time; a novel type or phase of non-equilibrium matter
In condensed matter physics, a time crystal is a quantum system of particles whose lowest-energy state is one in which the particles are in repetitive
Time_crystal
Algorithm in quantum information theory
information theory. The cooling itself is done in an algorithmic manner using ordinary quantum operations. The input is a set of qubits, and the output
Algorithmic_cooling
Process of copying a quantum state with no modification of the original
Quantum cloning is a process that takes an arbitrary, unknown quantum state and makes an exact copy without altering the original state in any way. Quantum
Quantum_cloning
This list contains quantum processors, also known as quantum processing units (QPUs). Some devices listed below have only been announced at press conferences
List_of_quantum_processors
Proposed spin-based quantum computer implementation
implementation of Shor's algorithm in a 7-qubit NMR quantum computer. However, even from the early days, it was recognized that NMR quantum computers would never
Nuclear magnetic resonance quantum computer
Nuclear_magnetic_resonance_quantum_computer
Open-source software development kit
programs (quantum applications or algorithmic routines) on the IBM Quantum Platform to invoke as needed. This turns custom quantum algorithms into services
Qiskit
Paradigm of quantum computer
Linear optical quantum computing or linear optics quantum computation (LOQC), also photonic quantum computing (PQC), is a paradigm of quantum computation
Linear optical quantum computing
Linear_optical_quantum_computing
Deviations from local realism
theoretical physics, quantum nonlocality refers to the phenomenon by which the measurement statistics of a multipartite quantum system do not allow an
Quantum_nonlocality
Point defect in diamonds
implementation of quantum algorithms and networks. It has also been explored for applications in quantum computing (e.g. for entanglement generation), quantum simulation
Nitrogen-vacancy_center
Proposed semiconductor implementation of quantum computers
The spin qubit quantum computer is a quantum computer based on controlling the spin of charge carriers (electrons and electron holes) in semiconductor
Spin_qubit_quantum_computer
Quantum-informatics technique
The term quantum state discrimination collectively refers to quantum-informatics techniques, with the help of which, by performing a small number of measurements
Quantum_state_discrimination
or diffusion quantum Monte Carlo is a quantum Monte Carlo method that uses a Green's function to calculate low-lying energies of a quantum many-body Hamiltonian
Diffusion_Monte_Carlo
Foundational object in quantum communication theory
In quantum information theory, a quantum channel is a communication channel that can transmit quantum information, as well as classical information. An
Quantum_channel
Quantum key distribution protocol
prepare-and-measure quantum key distribution (QKD) protocol, in which, one party (e.g. Alice) performs the encoding by preparing the quantum states, and the
BB84
Property of states in quantum mechanics
In physics, in the area of quantum information theory and quantum computation, quantum steering is a special kind of nonlocal correlation, which is intermediate
Quantum_steering
Theorem in physics
number of closely related results in physics, all of which determine that quantum mechanics is incompatible with local hidden-variable theories, given some
Bell's_theorem
Unit of quantum information
A qutrit (or quantum trit) is a unit of quantum information that is realized by a 3-level quantum system (qudit with radix 3), that may be in a superposition
Qutrit
Definition of quantum circuits
In quantum computing and quantum information theory, the Clifford gates are the elements of the Clifford group, a set of mathematical transformations
Clifford_gate
Quantum error correcting code
(GKP) code is a quantum error correcting code that encodes logical qubits into the continuous degrees of freedom of a quantum system. It is named
Gottesman–Kitaev–Preskill code
Gottesman–Kitaev–Preskill_code
QUANTUM PHASE-ESTIMATION-ALGORITHM
QUANTUM PHASE-ESTIMATION-ALGORITHM
Girl/Female
Biblical
Estimation, thought.
Surname or Lastname
German
German : nickname for a swift runner or a timorous person, from Middle High German, Middle Low German hase ‘hare’.Jewish (Ashkenazic) : ornamental name from German Hase ‘hare’.English : from a Middle English nickname, Hase, from Old English hÄs ‘harsh, raucous, or hoarse voice’.Japanese : usually written with characters meaning ‘long valley’; habitational name from a place in Yamato (now Nara prefecture). Listed in the Shinsen shÅjiroku. Some bearers are descended from the Taira clan; they are found mainly in eastern Japan. Also pronounced Nagaya and Nagatani; the original pronunciation was Hatsuse, meaning ‘beginning of the strait’.
Surname or Lastname
English
English : from Middle English pese ‘pea’, hence a metonymic occupational name for a grower or seller of peas, or a nickname for a small and insignificant person. The word was originally a collective singular (Old English peose, pise, from Latin pisa) from which the modern English vocabulary word pea is derived by folk etymology, the singular having been taken as a plural.Robert and John Pease came from Great Baddow, Essex, England, to Salem, MA, in 1634. In 1644 Robert died, leaving a son (also called Robert) who was apprenticed as a weaver in Salem. By 1646 John Pease was living on Martha’s Vineyard.
Girl/Female
Muslim
Estimator
Boy/Male
Tamil
Destination
Biblical
the estimation of the Lord
Girl/Female
Arabic, Muslim
Estimator
Male
French
French form of Latin Stephanus, STÉPHANE means "crown."
Girl/Female
Biblical
Fourth.
Girl/Female
Tamil
Destination
Biblical
estimation; thought
Surname or Lastname
English
English : metonymic occupational name for a huntsman, or rather a nickname for an exceptionally skilled huntsman, from Middle English chase ‘hunt’ (Old French chasse, from chasser ‘to hunt’, Latin captare).Southern French : topographic name for someone who lived in or by a house, probably the occupier of the most distinguished house in the village, from a southern derivative of Latin casa ‘hut’, ‘cottage’, ‘cabin’.Thomas Chase came to MA from Chesham, Buckinghamshire, England, in the 1640s, and had many prominent descendants. Samuel Chase, born in Somerset Co., MD, in 1741, was one of the first members of the U.S. Supreme Court; Philander Chase, born in Cornish, NH, in 1741 was a prominent Episcopal clergyman, and his nephew Salmon Portland Chase (1808–73), also born in Cornish, was governor of OH, a U.S. senator, and secretary of the U.S. Treasury during the Civil War.
Male
English
Middle English surname (of Norman French origin) transferred to forename use, CHASE means "hunter."Â
Girl/Female
Hindu
Destination
Boy/Male
English American
Huntsman.
Boy/Male
American, Australian, British, Chinese, Christian, English, French
Huntsman; Hunter
Boy/Male
Biblical
The estimation of the Lord.
Boy/Male
Hindu
Destination
Boy/Male
Indian
Destination
Boy/Male
Indian
Destination
QUANTUM PHASE-ESTIMATION-ALGORITHM
QUANTUM PHASE-ESTIMATION-ALGORITHM
Surname or Lastname
English (Cornwall)
English (Cornwall) : unexplained. This name is found mainly in GA.
Surname or Lastname
English and French
English and French : nickname, possibly sometimes applied ironically, from Middle English gente, Old French gent(il) ‘well born’, ‘noble’, ‘courteous’. Compare Gentle.German and English : habitational name for someone from Ghent in Flanders, French name Gand.
Male
Hindi/Indian
(काम) Hindi myth name of the god of love and son of Lakshmi, KAMA means "desire, love."
Surname or Lastname
English
English : from a byname meaning ‘servant of the cook’ (see Cook).
Boy/Male
Hindu, Indian
The Sun
Girl/Female
Arabic, Muslim
Flower of Paradise
Girl/Female
American, Christian, English, Finnish, German, Greek, Indian, Moldovan, Russian, Swedish
Resurrection; One who Shall Rise Again
Male
Swiss
, famous wolf.
Boy/Male
Indian
Holy war
Surname or Lastname
English
English : variant of Sly, with the addition of Middle English man ‘man’.Dutch : from Middle Dutch slie, sly ‘tench’ + man ‘man’, occupational name for a catcher or seller of these fish.
QUANTUM PHASE-ESTIMATION-ALGORITHM
QUANTUM PHASE-ESTIMATION-ALGORITHM
QUANTUM PHASE-ESTIMATION-ALGORITHM
QUANTUM PHASE-ESTIMATION-ALGORITHM
QUANTUM PHASE-ESTIMATION-ALGORITHM
pl.
of Phase
n.
A definite portion of a manifoldness, limited by a mark or by a boundary.
a.
Invaluable; being beyond estimation.
n.
Esteem; account; estimation.
v. t.
To follow as if to catch; to pursue; to compel to move on; to drive by following; to cause to fly; -- often with away or off; as, to chase the hens away.
n.
The liberty or franchise of having a chase; free chase.
pl.
of Quantum
n.
The act of estimating one's self; self-esteem.
v. i.
Estimation; character.
n.
Quantity; amount.
n.
Rank; grade; station; estimation.
v. i.
To give chase; to hunt; as, to chase around after a doctor.
a.
Inclined, or able, to estimate; serving for, or capable of being used in, estimating.
n.
Estimation; valuation.
v. i.
To group notes into phrases; as, he phrases well. See Phrase, n., 4.
v. t.
An opinion or judgment of the worth, extent, or quantity of anything, formed without using precise data; valuation; as, estimations of distance, magnitude, amount, or moral qualities.
n.
Any appearance or aspect of an object of mental apprehension or view; as, the problem has many phases.
n.
A brief expression, sometimes a single word, but usually two or more words forming an expression by themselves, or being a portion of a sentence; as, an adverbial phrase.
v. t.
The act of estimating.
n.
A particular appearance or state in a regularly recurring cycle of changes with respect to quantity of illumination or form of enlightened disk; as, the phases of the moon or planets. See Illust. under Moon.