Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Protein Networks02:26

Protein Networks

4.6K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.6K
Inertia Tensor01:24

Inertia Tensor

1.2K
The concept of the inertia tensor is employed to depict the mass distribution and rotational inertia of a solid or rigid object. This tensor is expressed through a three-by-three matrix. Each component within this matrix corresponds to varying moments of inertia about specific axes.
The diagonal components of the inertia tensor matrix represent the moments of inertia concerning the principal axes of the object. These primary axes are defined as the axes where the object experiences the least...
1.2K
Area Computation by the Alternative Coordinate Method01:24

Area Computation by the Alternative Coordinate Method

655
The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...
655
Classical Conditioning01:18

Classical Conditioning

2.4K
Associative learning, a core principle in behavioral psychology, involves forming connections between events and facilitating learned responses. This concept is vividly illustrated by classical conditioning, a process extensively studied by the Russian physiologist Ivan Pavlov. Pavlov's pioneering research on dogs' digestive systems led to the discovery that behaviors can be learned through association, laying the groundwork for classical conditioning.
Ivan Pavlov observed that dogs...
2.4K
Principles of Classical Conditioning01:23

Principles of Classical Conditioning

2.0K
Classical conditioning, as described by Ivan Pavlov, is a foundational concept in associative learning, where a neutral stimulus becomes capable of eliciting a conditioned response through association with an unconditioned stimulus. The process of acquisition, where this learning occurs, and the subsequent phenomena of contiguity, contingency, generalization, discrimination, extinction, and spontaneous recovery are crucial for a comprehensive understanding of classical conditioning.
During the...
2.0K
Network Covalent Solids02:18

Network Covalent Solids

16.2K
Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
16.2K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Fully Guided Implant Placement and Immediate Loading for the Restoration of the Edentulous Maxilla with a Fixed Dental Prosthesis: Report of Two Clinical Cases.

Dentistry journal·2026
Same author

Green's function methods for computing supercurrents in Josephson junctions.

Reports on progress in physics. Physical Society (Great Britain)·2026
Same author

Astragaloside IV Attenuates Heart Failure by Modulating SCAD/DJ-1/SIRT1/FOXO3a Signaling Axis.

The American journal of Chinese medicine·2026
Same author

The effect of sodium restricted diet on the prognosis of heart failure patients: a systemic review and meta-analysis.

Frontiers in cardiovascular medicine·2026
Same author

Topological Robustness of Anyon Tunneling at ν=1/3.

Physical review letters·2026
Same author

Hall-on-Toric State: Descendant Laughlin State in the Chiral Z_{p} Toric Code.

Physical review letters·2026
Same journal

Erratum: Low-dimensional model for adaptive networks of spiking neurons [Phys. Rev. E 111, 014422 (2025)].

Physical review. E·2026
Same journal

Disentangling the effects of many-body forces on depletion interactions.

Physical review. E·2026
Same journal

Charge transport and mode transition in dual-energy electron beam diodes.

Physical review. E·2026
Same journal

Optimization of multisite reactions in complex compartmentalized media.

Physical review. E·2026
Same journal

Origin of geometric cohesion in nonconvex granular materials: Interplay between interdigitation and rotational constraints enhancing frictional stability.

Physical review. E·2026
Same journal

Interaction of walkers with a standing Faraday wave.

Physical review. E·2026
See all related articles

Related Experiment Video

Updated: Feb 10, 2026

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

10.9K

Tensor network method for reversible classical computation.

Zhi-Cheng Yang1, Stefanos Kourtis1, Claudio Chamon1

  • 1Physics Department, Boston University, Boston, Massachusetts 02215, USA.

Physical Review. E
|May 20, 2018
PubMed
Summary
This summary is machine-generated.

We developed a novel tensor network technique to efficiently solve complex computational problems. This method accurately counts solutions for problems intractable by traditional enumeration, advancing computational science.

More Related Videos

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases
09:33

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Published on: July 28, 2013

29.3K
A Method to Study Adaptation to Left-Right Reversed Audition
07:14

A Method to Study Adaptation to Left-Right Reversed Audition

Published on: October 29, 2018

6.9K

Related Experiment Videos

Last Updated: Feb 10, 2026

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

10.9K
Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases
09:33

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Published on: July 28, 2013

29.3K
A Method to Study Adaptation to Left-Right Reversed Audition
07:14

A Method to Study Adaptation to Left-Right Reversed Audition

Published on: October 29, 2018

6.9K

Area of Science:

  • Computational Physics
  • Quantum Information Science
  • Theoretical Computer Science

Background:

  • Classical computational problems can be mapped to vertex models on a square lattice.
  • Tensor networks provide a powerful framework for representing and contracting complex systems.
  • Efficiently solving large-scale computational problems remains a significant challenge.

Purpose of the Study:

  • To develop a tensor network technique for solving universal reversible classical computational problems.
  • To introduce an efficient algorithm for contracting tensor networks representing these problems.
  • To enable exact counting of solutions for computationally intensive problems.

Main Methods:

  • Formulating computational problems as vertex models on a square lattice.
  • Encoding vertex constraints as tensors and representing the problem as a tensor network.
  • Implementing an iterative compression-decimation (ICD) scheme for efficient tensor network contraction.
  • Utilizing repeated contraction-decomposition and coarse-graining for lattice decimation.

Main Results:

  • The iterative compression-decimation (ICD) scheme efficiently contracts tensor networks.
  • The method allows for automatic collapse of the tensor network without manual dimension control.
  • Exact tensor traces for large systems are obtained, yielding the precise number of solutions.
  • The technique successfully solves problems where naive enumeration is computationally infeasible.

Conclusions:

  • The developed tensor network technique offers an efficient and scalable solution for universal reversible classical computations.
  • The ICD algorithm provides a robust method for handling complex tensor network contractions.
  • This approach significantly advances the ability to solve computationally intractable problems, with broad implications for physics and computer science.